{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874016,0.0001185718,0.0001206403,0.0000384434,0.0002392072,0.00007147685,0.000154193,0.00002911929,0.0000283855],"category_scores_gemma":[0.000006129562,0.00008653198,0.00003096769,0.0005676254,0.0002300135,0.0002450433,0.000001730964,0.0001044089,0.00000722174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002427178,"about_ca_system_score_gemma":0.00009196004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001696075,"about_ca_topic_score_gemma":0.0001101742,"domain_scores_codex":[0.9990097,0.000004702777,0.0001959613,0.0002442879,0.0002681303,0.0002771736],"domain_scores_gemma":[0.9995028,0.00009225252,0.00003029487,0.0001582472,0.0001399461,0.00007642039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009326057,0.0002083592,0.02012177,0.000505729,0.0002641749,0.000153778,0.01869272,0.2737424,0.2412674,0.03517147,0.0003189378,0.40946],"study_design_scores_gemma":[0.00167095,0.00007497422,0.06886875,0.00007890646,0.0001353601,0.00001721977,0.0002423179,0.881313,0.04360627,0.0009496722,0.002579203,0.000463342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05664636,0.0002692025,0.9407852,0.0001478042,0.00009818912,0.0003671104,0.000061493,0.0001991384,0.001425489],"genre_scores_gemma":[0.9600804,0.00003009558,0.03949136,0.00007521641,0.00003951462,0.00003645456,0.00002639019,0.00001901916,0.000201579],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.903434,"threshold_uncertainty_score":0.3528672,"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."}}