{"id":"W1985971056","doi":"10.1287/trsc.2015.0593","title":"A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem","year":2015,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Mathematical optimization; Branch and price; Integer programming; Linear programming; Arc (geometry); Branch and bound; Column generation; Mathematics; Minification; Integer (computer science); Set (abstract data type); Vehicle routing problem; Routing (electronic design automation); Algorithm; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001076924,0.001444825,0.001586636,0.0009642977,0.0007371444,0.00135996,0.001936313,0.001992738,0.008521611],"category_scores_gemma":[0.003353211,0.0007668911,0.000917327,0.001802354,0.0006531806,0.002116717,0.001402684,0.002227414,0.001183774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125578,"about_ca_system_score_gemma":0.002074128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004132641,"about_ca_topic_score_gemma":0.004409959,"domain_scores_codex":[0.9993603,0.0002037653,0.00003110531,0.0001282484,0.0001838776,0.00009282213],"domain_scores_gemma":[0.999117,0.0005896423,0.0000628593,0.00005523564,0.0001229877,0.00005222409],"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.0001019317,0.0002007924,0.0003749889,0.000171712,0.00005685702,0.0001474546,0.00007946832,0.7771019,0.001564781,0.04445001,0.00739611,0.168354],"study_design_scores_gemma":[0.00003630479,0.00004226583,0.00004311223,0.000007087471,0.000009485125,0.00003284792,0.00001402585,0.9823409,0.0003520984,0.01558619,0.001529877,0.000005755966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006966046,0.0002079998,0.9878414,0.0002875644,0.00004993981,0.0001443009,0.0000789674,0.0003013032,0.00412247],"genre_scores_gemma":[0.08738266,0.0003246535,0.9072774,0.0001457235,0.00006632505,0.0004003017,0.0003361018,0.0002090007,0.003857745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008521611,"threshold_uncertainty_score":0.02850765,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.027579331617463,"score_gpt":0.2762793489469292,"score_spread":0.2487000173294662,"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."}}