{"id":"W3132873744","doi":"10.1287/opre.2020.2037","title":"Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"École de Technologie Supérieure; Group for Research in Decision Analysis; Wilfrid Laurier University; Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Branch and cut; Routing (electronic design automation); Mathematical optimization; Algorithm; 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.0009928891,0.00009624376,0.0001156472,0.0000708967,0.0006979607,0.0002891201,0.00008694519,0.00006173276,0.00004365007],"category_scores_gemma":[0.0003159517,0.00007206891,0.00001456842,0.0005103901,0.0001088276,0.0001310107,0.00005452703,0.0003171051,0.000005402447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003870504,"about_ca_system_score_gemma":0.0001005665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000332284,"about_ca_topic_score_gemma":0.0000571521,"domain_scores_codex":[0.9989785,0.0001368989,0.0001611607,0.0002102932,0.000218242,0.0002948807],"domain_scores_gemma":[0.9986019,0.0007522687,0.000007252092,0.0001863708,0.0003801146,0.00007207151],"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.000007559823,0.00001445048,0.00005398357,0.00003465137,0.00005364704,0.000001738533,0.001212545,0.9773242,0.004633984,0.001965031,0.0001115953,0.01458661],"study_design_scores_gemma":[0.0004826339,0.00004009754,0.000527236,0.00004045335,0.00001469681,0.00002588764,0.0005077344,0.9962324,0.001866942,0.00007165685,0.00009259718,0.00009765101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02639275,0.0006477461,0.9700409,0.001108536,0.00004264577,0.0007577738,0.00001547744,0.00008644365,0.0009076952],"genre_scores_gemma":[0.8598703,0.00008944549,0.1373186,0.00002360631,0.00006605798,0.0002277512,0.00002038767,0.00004951409,0.002334362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8334775,"threshold_uncertainty_score":0.536822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04996269097259656,"score_gpt":0.3392341381493094,"score_spread":0.2892714471767129,"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."}}