{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008804376,0.00009952846,0.00009371846,0.00007864986,0.0002200335,0.0000903101,0.0001932614,0.00003792555,0.000004343045],"category_scores_gemma":[0.00006875512,0.00008401774,0.00002279999,0.0008048132,0.0001290576,0.0004364529,0.000004040137,0.00005481895,0.000001391523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004572792,"about_ca_system_score_gemma":0.00008139785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003006605,"about_ca_topic_score_gemma":0.00001898045,"domain_scores_codex":[0.9989861,0.00001955118,0.0002460204,0.0002103601,0.0003041997,0.0002337991],"domain_scores_gemma":[0.9992952,0.0001563521,0.00005648773,0.0001375296,0.0002486089,0.0001057653],"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.00000558233,0.0000102372,0.0007322006,0.00001874631,0.000009374803,3.948316e-7,0.00403203,0.8357518,0.003149986,0.004377481,0.0001250332,0.1517871],"study_design_scores_gemma":[0.0003737507,0.00001672738,0.003026707,0.00001045395,0.0000149835,0.00000133364,0.0002148483,0.988463,0.006080857,0.0003641025,0.001315775,0.0001174701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01305415,0.0001040277,0.9858073,0.000150313,0.000184665,0.00019555,0.00001046917,0.0002120658,0.0002814278],"genre_scores_gemma":[0.7288464,0.00002695576,0.2708364,0.00009043141,0.00004807549,0.0000514167,0.00001132691,0.00001992138,0.00006902644],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7157922,"threshold_uncertainty_score":0.3426144,"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."}}