{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487884,0.001258173,0.002036127,0.00103484,0.0009845992,0.001666775,0.002606223,0.002307818,0.007029866],"category_scores_gemma":[0.004315475,0.001147106,0.001221938,0.001800454,0.0009736504,0.002542959,0.001932048,0.001597118,0.0008752876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955867,"about_ca_system_score_gemma":0.004140304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01419672,"about_ca_topic_score_gemma":0.01386775,"domain_scores_codex":[0.9991114,0.000167688,0.00004631195,0.0002125901,0.0002832191,0.0001787585],"domain_scores_gemma":[0.9985691,0.000911638,0.00009627333,0.0001431073,0.0002047463,0.00007501143],"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.0001563863,0.0001157026,0.0002842391,0.0001227311,0.00004515421,0.00007079786,0.00007073577,0.8553041,0.001014554,0.01712256,0.002945725,0.1227473],"study_design_scores_gemma":[0.00005834566,0.00002738369,0.00006027841,0.000007411865,0.00001217564,0.00002494432,0.00001474179,0.9895362,0.0001779637,0.009289299,0.0007844,0.000006894368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009460258,0.0002856512,0.9856397,0.0001988297,0.0001207305,0.0001080652,0.0001019637,0.0005628989,0.003521799],"genre_scores_gemma":[0.1395732,0.0003111245,0.8550409,0.000143575,0.00009920709,0.0003588284,0.0002407567,0.0001525176,0.004079866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01419672,"threshold_uncertainty_score":0.02822816,"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."}}