{"id":"W2090707215","doi":"10.1002/net.21594","title":"Reaching the elementary lower bound in the vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Vehicle routing problem; Upper and lower bounds; Relaxation (psychology); Routing (electronic design automation); Mathematical optimization; Set (abstract data type); Shortest path problem; State space; Computer science; Mathematics; Tree (set theory); Branch and bound; State (computer science); Space (punctuation); Algorithm; Combinatorics","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.002284907,0.0001470896,0.00012827,0.00002913075,0.0001293833,0.0001288551,0.0003036384,0.00006690939,0.00001665512],"category_scores_gemma":[0.00002718372,0.00008713879,0.0000256649,0.0003805209,0.00003644974,0.0001474747,0.00004429199,0.0005232775,0.00001393445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009807164,"about_ca_system_score_gemma":0.00002072583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005258194,"about_ca_topic_score_gemma":0.00005502896,"domain_scores_codex":[0.9987488,0.0002756688,0.000233072,0.0001514665,0.0002335116,0.0003574705],"domain_scores_gemma":[0.9993314,0.0002244502,0.0000471038,0.0003213726,0.0000286096,0.0000471015],"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.00001293233,0.00001170204,0.004233862,0.000003137552,0.00001658618,0.000007035925,0.001560742,0.9861912,0.00001937266,0.00007480071,0.00197118,0.005897464],"study_design_scores_gemma":[0.0004423623,0.00003866428,0.001091444,0.00004928732,0.00001575539,0.00001363989,0.0003543581,0.9953823,0.00001220844,0.00008979673,0.002372382,0.0001378011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5821046,0.0009400838,0.3641913,0.001781865,0.0005840217,0.001636715,0.000002902746,0.0008173566,0.04794119],"genre_scores_gemma":[0.9802124,0.000006437127,0.01879266,0.0004771494,0.0003321245,0.00003376023,0.000009710856,0.00004937919,0.00008635569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3981079,"threshold_uncertainty_score":0.3553417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01564087598570789,"score_gpt":0.2372260595233076,"score_spread":0.2215851835375998,"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."}}