{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908055,0.0009346855,0.001136152,0.0006481196,0.0005201307,0.001016362,0.001203163,0.0008722213,0.003693165],"category_scores_gemma":[0.004815156,0.0006389834,0.0008425223,0.001416736,0.000822663,0.002311423,0.001015152,0.002338322,0.0005318708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008778104,"about_ca_system_score_gemma":0.001482775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002666356,"about_ca_topic_score_gemma":0.002782138,"domain_scores_codex":[0.9990037,0.0004298167,0.00002969071,0.00009387114,0.0003349456,0.000108009],"domain_scores_gemma":[0.9983549,0.001183894,0.0001249658,0.0001153898,0.0001598308,0.00006098339],"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.0001687012,0.0001041435,0.0004289246,0.000152336,0.00005678728,0.00009749681,0.00007085668,0.831802,0.001961123,0.06833604,0.00193275,0.09488893],"study_design_scores_gemma":[0.00001583466,0.0000357383,0.00006565618,0.000005742008,0.000007799113,0.00002207858,0.000006395198,0.9813757,0.0004629701,0.01704561,0.0009526624,0.000003813336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01422362,0.0004284394,0.9824532,0.0001116208,0.00004248777,0.00007316968,0.00004748097,0.0001031775,0.002516842],"genre_scores_gemma":[0.244213,0.0008014123,0.7495729,0.0001019711,0.00009327543,0.0002689454,0.0002450709,0.0001430997,0.004560358],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003693165,"threshold_uncertainty_score":0.01235485,"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."}}