{"id":"W2099860183","doi":"10.1016/j.ejor.2009.06.034","title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":272,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Vehicle routing problem; Column generation; Mathematical optimization; Benchmark (surveying); Computer science; Routing (electronic design automation); Shortest path problem; Lagrangian relaxation; Set (abstract data type); Linear programming; Dynamic programming; Mathematics; Computer network","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.004128777,0.0001058066,0.0001856613,0.0002098188,0.0001566964,0.0001896112,0.0001794701,0.00002362518,0.00001365531],"category_scores_gemma":[0.00040041,0.00008744001,0.00003478644,0.0002319258,0.00006551816,0.0006332279,0.00001916371,0.0003055828,0.000002726229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004178917,"about_ca_system_score_gemma":0.00008057009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001746352,"about_ca_topic_score_gemma":3.420783e-7,"domain_scores_codex":[0.9980466,0.0006389552,0.0004423163,0.0001303368,0.00050476,0.0002370173],"domain_scores_gemma":[0.9981675,0.0005410778,0.00008691329,0.0001246853,0.0009323222,0.0001475063],"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.0001458218,0.0001039624,0.001306328,0.00002251197,0.00005537567,0.00003315548,0.000698733,0.7455714,0.1144578,0.0001251578,0.0003124075,0.1371674],"study_design_scores_gemma":[0.001231776,0.001129718,0.01349472,0.0001129929,0.000008327923,0.00006293878,0.00005940915,0.976464,0.006857392,0.00002179124,0.0004474687,0.0001094188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6098316,0.0001068815,0.3889534,0.000248793,0.00002169047,0.0003763297,0.00002212,0.00003625351,0.0004028926],"genre_scores_gemma":[0.5798408,0.00001374262,0.4199263,0.0000171604,0.0001124532,7.245367e-7,0.000004864396,0.00002740337,0.00005652455],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2308927,"threshold_uncertainty_score":0.35657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06359111993787328,"score_gpt":0.3323522610403489,"score_spread":0.2687611411024756,"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."}}