{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00132371,0.001289555,0.001951057,0.0009746955,0.0009848352,0.00171052,0.002708444,0.002278733,0.008048504],"category_scores_gemma":[0.003659507,0.001147398,0.001045897,0.00182503,0.0008915251,0.002729199,0.001808724,0.001551142,0.001151789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002011374,"about_ca_system_score_gemma":0.003878652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01323682,"about_ca_topic_score_gemma":0.01418545,"domain_scores_codex":[0.999301,0.000115055,0.00003689505,0.0001890019,0.000212418,0.0001456471],"domain_scores_gemma":[0.998852,0.0006885885,0.00007975671,0.0001354485,0.0001705318,0.00007362712],"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.0002103763,0.0001384842,0.0002853409,0.0001494117,0.00004617949,0.00007480589,0.00007722002,0.8304458,0.001340003,0.01454211,0.003738595,0.1489516],"study_design_scores_gemma":[0.00006707618,0.00002626333,0.00005937284,0.000007432403,0.00001290571,0.00002445599,0.00001533708,0.9908285,0.0002385243,0.007896526,0.0008164599,0.000007215675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01169219,0.0003341401,0.9822271,0.0002124082,0.0001178216,0.0001177053,0.0001187926,0.0008793896,0.004300313],"genre_scores_gemma":[0.1207095,0.0002652044,0.8745915,0.0001081728,0.00007728751,0.0002700959,0.0002246951,0.0001692811,0.003584363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01323682,"threshold_uncertainty_score":0.02692491,"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."}}