{"id":"W2158354221","doi":"10.1287/trsc.1100.0363","title":"Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows","year":2011,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":99,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Vehicle routing problem; Column generation; Tabu search; Mathematical optimization; Routing (electronic design automation); Path (computing); Computer science; Branch and cut; Mathematics; Integer programming; Computer network","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.0003709662,0.00008732756,0.0001000916,0.0000572287,0.0001559087,0.00004392893,0.00005628752,0.00002612907,0.00000938379],"category_scores_gemma":[0.00002280682,0.00008215477,0.000006273922,0.0002485544,0.0002225432,0.000486713,0.000002932595,0.0000417478,6.232013e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008601941,"about_ca_system_score_gemma":0.00001948036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000011012,"about_ca_topic_score_gemma":0.00001283593,"domain_scores_codex":[0.9993567,0.000007570191,0.0001379247,0.0002137063,0.0001156146,0.0001684997],"domain_scores_gemma":[0.9996779,0.00005781812,0.00003486059,0.00007240798,0.00008214737,0.00007489193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.0002948153,0.00004499623,0.08912767,0.0006108946,0.00005479916,0.000004610713,0.0909577,0.04164398,0.6807545,0.01007647,0.000006745342,0.08642286],"study_design_scores_gemma":[0.0009498409,0.0001413683,0.6175725,0.00006346824,0.00003356256,0.000005591824,0.0003305561,0.2734932,0.1068184,0.0002593817,0.00002202514,0.0003100605],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949833,0.00002877538,0.3044165,0.000008064416,0.00001335981,0.0001500109,0.000004833268,0.00007325473,0.0003218949],"genre_scores_gemma":[0.8911614,0.0000207244,0.1087435,0.0000176435,0.00000583305,0.0000116748,0.000001851197,0.0000110977,0.00002629886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.573936,"threshold_uncertainty_score":0.3350174,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01725819034614307,"score_gpt":0.2402429470521979,"score_spread":0.2229847567060548,"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."}}