{"id":"W1966716113","doi":"10.1016/j.ejor.2006.02.019","title":"An exact algorithm for a single-vehicle routing problem with time windows and multiple routes","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":203,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Computer science; Set (abstract data type); Shortest path problem; Routing (electronic design automation); Mathematical optimization; Path (computing); Algorithm; Euclidean geometry; Mathematics; Theoretical computer science; Graph","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.004591458,0.0001249912,0.0001666964,0.0002027403,0.0002631695,0.0003546281,0.0001984542,0.00002471837,0.00002611977],"category_scores_gemma":[0.0002136202,0.0001040357,0.00003385892,0.0002364915,0.00007356752,0.0005160838,0.00002916365,0.0003255263,0.000008615417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008045208,"about_ca_system_score_gemma":0.00007121646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005752064,"about_ca_topic_score_gemma":0.000001979323,"domain_scores_codex":[0.9979326,0.0006426281,0.000428427,0.0001596119,0.0005313529,0.0003053878],"domain_scores_gemma":[0.9983571,0.0005001691,0.00007268193,0.000113907,0.0008238227,0.0001322882],"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.00006902608,0.0001187477,0.001787562,0.0000242445,0.0000465155,0.00005963409,0.0003243655,0.8313988,0.1244668,0.0001525361,0.0005174119,0.04103439],"study_design_scores_gemma":[0.001407016,0.0006896286,0.003518713,0.00008316957,0.000008242731,0.0001600176,0.00006427254,0.9861697,0.006817905,0.00003510032,0.000897545,0.0001486851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2283994,0.0001925163,0.7662514,0.0002437744,0.00004457701,0.0004403027,0.00002262206,0.0000757535,0.004329704],"genre_scores_gemma":[0.58465,0.000003743854,0.4147351,0.00001021389,0.0003741667,0.000002078308,0.00001178066,0.00005246236,0.0001604515],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3562506,"threshold_uncertainty_score":0.4242455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04058463769978288,"score_gpt":0.3074463557067402,"score_spread":0.2668617180069573,"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."}}