{"id":"W2066086285","doi":"10.1287/trsc.1030.0056","title":"Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms","year":2005,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1112,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Emil Aaltosen Säätiö","keywords":"Vehicle routing problem; Heuristic; Benchmark (surveying); Pareto principle; Mathematical optimization; Set (abstract data type); Metaheuristic; Point (geometry); Routing (electronic design automation); Computer science; Interval (graph theory); Local search (optimization); Algorithm; Mathematics","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.0007404433,0.0001201089,0.0001204386,0.0001133213,0.0002095225,0.00008479146,0.0001174594,0.00004272021,0.00004222411],"category_scores_gemma":[0.000006815329,0.0001139555,0.00001391182,0.0007650325,0.0004358123,0.0007519018,0.000003638809,0.0001394307,0.00001927977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007582192,"about_ca_system_score_gemma":0.00008055997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001644033,"about_ca_topic_score_gemma":0.00001874969,"domain_scores_codex":[0.9987337,0.00002388795,0.000246797,0.0002811087,0.0004132899,0.0003011994],"domain_scores_gemma":[0.9995419,0.00003719411,0.00003737911,0.0001255969,0.0001310725,0.0001267949],"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.000006576277,0.000006806341,0.006975449,0.00001583638,0.00000526089,0.00000162278,0.001144413,0.877481,0.004984897,0.0004044141,0.00000449177,0.1089692],"study_design_scores_gemma":[0.000454652,0.00003124717,0.02131861,0.00004100857,0.00001279156,0.00001440519,0.0002463672,0.9617651,0.01560047,0.00001719409,0.0003091231,0.0001890893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4034589,0.00002220584,0.5952296,0.0001089262,0.00003664822,0.00016147,0.000008547915,0.0002711708,0.0007025945],"genre_scores_gemma":[0.6993262,0.000009007581,0.3005314,0.00002072971,0.00003375479,0.000006456874,0.000008338528,0.00001452268,0.00004963214],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2958674,"threshold_uncertainty_score":0.4646972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0132602200802881,"score_gpt":0.2520301703643327,"score_spread":0.2387699502840446,"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."}}