{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008326856,0.0000961113,0.0001097917,0.00008680921,0.0001850853,0.00007559529,0.00009030478,0.0000281577,0.000003581403],"category_scores_gemma":[0.00002441888,0.00007311183,0.000008662669,0.0002883176,0.0001909174,0.0003434523,0.000003394937,0.00006692533,0.000001041586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001481844,"about_ca_system_score_gemma":0.00001964832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001444716,"about_ca_topic_score_gemma":0.0001482102,"domain_scores_codex":[0.9992594,0.00001200937,0.0001601464,0.0002204263,0.000158761,0.0001892433],"domain_scores_gemma":[0.9994878,0.000269599,0.00003481591,0.0000902089,0.00005568253,0.00006194815],"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.00004103992,0.00001540123,0.05443148,0.0002606373,0.00002054489,0.0000013904,0.01440769,0.8528774,0.01271941,0.001331168,0.00001566619,0.06387813],"study_design_scores_gemma":[0.0007036667,0.00004452709,0.115546,0.00005550938,0.00001888721,0.000003477945,0.00008499829,0.8812339,0.00173546,0.0001571793,0.0002666176,0.0001497755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3911624,0.00008640556,0.6080866,0.0001099666,0.00003371012,0.0002984127,0.000003860494,0.00006594668,0.0001526805],"genre_scores_gemma":[0.8875884,0.0000499623,0.112241,0.00003736855,0.0000152483,0.00002597643,0.000001808195,0.00001311228,0.00002710161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4964261,"threshold_uncertainty_score":0.2981414,"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."}}