{"id":"W3107189808","doi":"10.1287/trsc.2021.1092","title":"A Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem with Time Windows","year":2021,"lang":"en","type":"article","venue":"Transportation Science","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Vehicle routing problem; Benchmark (surveying); Echelon formation; Computer science; Mathematical optimization; Routing (electronic design automation); Branch and cut; Algorithm; Process (computing); Integer programming; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001393399,0.0018222,0.002120906,0.001205084,0.0009367994,0.001808855,0.002266744,0.002232719,0.01053591],"category_scores_gemma":[0.003721698,0.001019846,0.001304607,0.002142822,0.0006065883,0.002312844,0.001294772,0.003458457,0.00163152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001947516,"about_ca_system_score_gemma":0.003486264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01022428,"about_ca_topic_score_gemma":0.008984868,"domain_scores_codex":[0.9989824,0.0002894855,0.00004790098,0.0002399274,0.0002789552,0.0001614136],"domain_scores_gemma":[0.9982351,0.001182797,0.0001244897,0.0001203374,0.0002204467,0.0001167727],"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.0001501632,0.000198161,0.0003840565,0.0001802232,0.00005612859,0.00008198015,0.0000482695,0.8257526,0.001156832,0.01387235,0.005833738,0.1522856],"study_design_scores_gemma":[0.00003096521,0.00002839428,0.00004776933,0.000007923984,0.000007778105,0.0000197485,0.000009923539,0.9930951,0.0002529896,0.005439029,0.001054882,0.000005502236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008754515,0.0004249459,0.9853562,0.0002936001,0.0001085998,0.0002388568,0.0002174553,0.0008347612,0.003771128],"genre_scores_gemma":[0.08151469,0.0003651816,0.9131383,0.0001776533,0.00007353817,0.0004046471,0.0008086951,0.0003146628,0.003202584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01053591,"threshold_uncertainty_score":0.03524619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01732423156048552,"score_gpt":0.2198908200264567,"score_spread":0.2025665884659712,"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."}}