{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003547184,0.001771559,0.001437101,0.0008178821,0.0008258684,0.002098395,0.001530333,0.001265761,0.005196655],"category_scores_gemma":[0.01179253,0.0004966488,0.001144365,0.001010834,0.00121726,0.003957984,0.001730497,0.002744775,0.0005570586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291607,"about_ca_system_score_gemma":0.002205374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002475676,"about_ca_topic_score_gemma":0.003169332,"domain_scores_codex":[0.9983786,0.0006778589,0.00005775108,0.0002291159,0.0002996834,0.0003570228],"domain_scores_gemma":[0.9885595,0.00984872,0.0004952559,0.0005425562,0.0002951974,0.0002586315],"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.000306792,0.0002295,0.0006274851,0.0003253353,0.00008346413,0.00008795314,0.0001903716,0.8540173,0.003944855,0.09512674,0.001629255,0.0434309],"study_design_scores_gemma":[0.00005808939,0.0002311729,0.0003279046,0.00004580705,0.00005230092,0.00005908976,0.000090318,0.9367768,0.003837041,0.05638147,0.002123231,0.00001689226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1361165,0.00129279,0.840011,0.0005584491,0.00007048268,0.0002497194,0.0001946397,0.0003072809,0.02119909],"genre_scores_gemma":[0.6506121,0.001653184,0.3417238,0.0002200345,0.00008298668,0.0003682371,0.0004221576,0.0003029225,0.004614623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005196655,"threshold_uncertainty_score":0.01875949,"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."}}