{"id":"W1997194016","doi":"10.1016/j.cor.2005.05.024","title":"Arcs-states models for the vehicle routing problem with time windows and related problems","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Column generation; Benchmark (surveying); Vehicle routing problem; Upper and lower bounds; Branch and bound; Relaxation (psychology); Routing (electronic design automation); Arc routing; Linear programming relaxation; Computer science; Arc (geometry); Mathematical optimization; Time complexity; Mathematics; Algorithm; Linear programming","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.001797472,0.001743864,0.00166245,0.001147351,0.0007020503,0.00317585,0.003296782,0.002405525,0.008009383],"category_scores_gemma":[0.005580219,0.001362542,0.002014608,0.00172377,0.001812447,0.004559125,0.001526914,0.003748687,0.0008758858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00250424,"about_ca_system_score_gemma":0.001996526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01392357,"about_ca_topic_score_gemma":0.01294377,"domain_scores_codex":[0.9990878,0.000322273,0.00004887853,0.0002004601,0.0001744585,0.000166185],"domain_scores_gemma":[0.9968526,0.002262392,0.0003949488,0.0001149122,0.0002044004,0.0001707416],"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.00006179406,0.00004817715,0.0002308658,0.0000641873,0.00003396604,0.00005127355,0.00007129668,0.7814498,0.0002950162,0.2126163,0.001365742,0.003711615],"study_design_scores_gemma":[0.00001331561,0.00001182241,0.00008615909,0.00001130132,0.0000174452,0.000009902631,0.0000206303,0.8953227,0.00008801894,0.1034788,0.000928668,0.00001116555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03591923,0.002129498,0.9406021,0.00163245,0.0002126886,0.00008703984,0.0009565192,0.0002420433,0.01821847],"genre_scores_gemma":[0.8220277,0.005012632,0.09438891,0.000381901,0.0004857376,0.0005153321,0.001594486,0.0003208534,0.07527239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01392357,"threshold_uncertainty_score":0.02768505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03967014977514591,"score_gpt":0.3086808878505363,"score_spread":0.2690107380753903,"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."}}