{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817098,0.001840934,0.002623433,0.001831023,0.001289565,0.002239089,0.002861428,0.00342783,0.005719883],"category_scores_gemma":[0.01216776,0.001862646,0.001381486,0.003231371,0.001166093,0.003688815,0.00160082,0.004595754,0.0007391889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00248839,"about_ca_system_score_gemma":0.004291049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01433859,"about_ca_topic_score_gemma":0.0154212,"domain_scores_codex":[0.9986197,0.0006838398,0.00006540101,0.000192036,0.0002687193,0.0001704083],"domain_scores_gemma":[0.9901008,0.008440965,0.0003837316,0.000263427,0.0005389836,0.0002720261],"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.00007038885,0.0001088373,0.0003251186,0.00005706845,0.00003934282,0.00002868091,0.0000325582,0.9497936,0.0001461542,0.01451928,0.001859162,0.03301995],"study_design_scores_gemma":[0.00001243029,0.000009806681,0.00003138847,0.000004537468,0.000004996979,0.000003239923,0.000003734588,0.9903106,0.00004081713,0.009427901,0.0001484967,0.000002111913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01072089,0.0004990762,0.9857883,0.0004420575,0.00008327096,0.0001119205,0.00013312,0.0002715449,0.001949756],"genre_scores_gemma":[0.2003094,0.0009338919,0.790784,0.0002002986,0.0002122462,0.0006076496,0.0007148781,0.0004139146,0.005823842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01433859,"threshold_uncertainty_score":0.02851027,"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."}}