{"id":"W2148767145","doi":"10.1287/trsc.2014.0535","title":"Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading","year":2014,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO and LIFO accounting; Pickup; Vehicle routing problem; Mathematical optimization; Computation; Column generation; Computer science; Algorithm; Path (computing); Dynamic programming; Shortest path problem; Mathematics; Routing (electronic design automation); FIFO (computing and electronics); Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580311,0.00258279,0.002577726,0.001520857,0.001384879,0.002414628,0.00348727,0.002654035,0.009694532],"category_scores_gemma":[0.006205346,0.001761999,0.001970622,0.002717957,0.001185614,0.0039829,0.001602614,0.003972036,0.001491311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003564497,"about_ca_system_score_gemma":0.003582945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01058159,"about_ca_topic_score_gemma":0.0118549,"domain_scores_codex":[0.9986441,0.0005139497,0.0000661548,0.0002342709,0.0002990281,0.0002425248],"domain_scores_gemma":[0.9969912,0.002291769,0.0002273522,0.0001734201,0.0001937244,0.0001225341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009176796,0.0001355445,0.0002518747,0.0001185991,0.0000400036,0.00003981099,0.00006742974,0.9020604,0.0003429694,0.03457502,0.002597933,0.05967872],"study_design_scores_gemma":[0.00002832346,0.00002498007,0.00003526952,0.00001137668,0.000009109308,0.00001213608,0.00001200421,0.9809564,0.0001574703,0.01791522,0.0008315408,0.000006025698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005578133,0.0005093704,0.9899527,0.0002205516,0.0000470679,0.0001462296,0.0001236086,0.0003565071,0.003065922],"genre_scores_gemma":[0.09561758,0.001096915,0.8969291,0.000143742,0.00009409367,0.0006593252,0.0006508377,0.0003541186,0.004454148],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01058159,"threshold_uncertainty_score":0.03243148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0149061226947526,"score_gpt":0.2440607767782444,"score_spread":0.2291546540834918,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}