{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006921121,0.0008593218,0.001199059,0.0005112438,0.0004280464,0.001739366,0.001104965,0.001046269,0.002686958],"category_scores_gemma":[0.001757251,0.0004570096,0.000693624,0.001842405,0.0005772199,0.002277653,0.0007035764,0.001134337,0.0006927949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.0008683926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317902,"about_ca_topic_score_gemma":0.001495881,"domain_scores_codex":[0.9995932,0.0001782924,0.00002204409,0.00007712287,0.00008407429,0.000045201],"domain_scores_gemma":[0.9995158,0.0003216254,0.00007482785,0.00002987982,0.00003594926,0.00002196111],"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.0001125332,0.0001180791,0.0004349384,0.0006620647,0.00008650278,0.000104568,0.0001221566,0.7119612,0.002317845,0.06884886,0.008429431,0.2068018],"study_design_scores_gemma":[0.00004867565,0.000124751,0.0002882833,0.00008190468,0.00004707299,0.0002010457,0.00008024577,0.9339967,0.001749996,0.04503241,0.01832497,0.00002394806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01315447,0.01357576,0.9611138,0.0006160376,0.0001157268,0.0001162932,0.0001411804,0.0003826878,0.0107841],"genre_scores_gemma":[0.391856,0.02429761,0.5623655,0.0002983878,0.0005227569,0.0006538067,0.0005331952,0.000318725,0.01915395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002686958,"threshold_uncertainty_score":0.008988738,"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."}}