{"id":"W2604913432","doi":"","title":"Reaching the Elementary Lower Bound in the Vehicle Routing Problem with Time Windows","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Column generation; Upper and lower bounds; Vehicle routing problem; Routing (electronic design automation); Relaxation (psychology); Mathematical optimization; Set (abstract data type); State space; Branch and bound; Tree (set theory); Mathematics; Path (computing); Shortest path problem; Computer science; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045684,0.0003392533,0.0002665011,0.0001805458,0.0003521579,0.0004458792,0.000741405,0.0001490634,0.00008726464],"category_scores_gemma":[0.00008289284,0.0002200818,0.00008038244,0.0007565363,0.00008199042,0.0005229152,0.000114059,0.0008357219,0.0000473802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003707448,"about_ca_system_score_gemma":0.00006040037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005546373,"about_ca_topic_score_gemma":0.001041337,"domain_scores_codex":[0.9975958,0.0003976477,0.0005076061,0.0003108647,0.000400305,0.0007877924],"domain_scores_gemma":[0.9985418,0.0003505217,0.0001218602,0.0008202071,0.00006169827,0.0001039439],"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.00004706256,0.0001960501,0.06438512,0.00006086243,0.0001278382,0.00005077564,0.004144134,0.8673505,0.01847194,0.002831246,0.00516474,0.03716972],"study_design_scores_gemma":[0.0004874346,0.00008213934,0.03100505,0.00008741191,0.00002825443,0.00007686214,0.0004703999,0.9642516,0.001622974,0.0006637517,0.0008401145,0.0003840105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6363426,0.0003641981,0.3502643,0.005623608,0.00007025681,0.002381364,0.000008798333,0.001159006,0.003785847],"genre_scores_gemma":[0.8553416,0.00002263383,0.1415655,0.001859198,0.0001112704,0.0007733006,0.00001345593,0.0001073893,0.0002056683],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.218999,"threshold_uncertainty_score":0.8974674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007703593308363791,"score_gpt":0.2147546257844881,"score_spread":0.2070510324761243,"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."}}