{"id":"W2115781168","doi":"10.1057/jors.2011.25","title":"An incremental tabu search heuristic for the generalized vehicle routing problem with time windows","year":2011,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Vehicle routing problem; Mathematical optimization; Guided Local Search; Computer science; Neighbourhood (mathematics); Incremental heuristic search; Heuristic; Heuristics; Beam search; Routing (electronic design automation); Algorithm; Search algorithm; Mathematics","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.00711255,0.0001127771,0.000150905,0.0000380336,0.0008230373,0.0001775332,0.0006382614,0.00006224902,0.0001451524],"category_scores_gemma":[0.0002190927,0.0000609106,0.0001500974,0.0003568712,0.0001649914,0.0003361036,0.00008079515,0.000660108,0.000005098789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002352327,"about_ca_system_score_gemma":0.00031221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002846859,"about_ca_topic_score_gemma":0.000004172065,"domain_scores_codex":[0.9976652,0.000483041,0.0003580638,0.0001193242,0.00101908,0.00035526],"domain_scores_gemma":[0.9980683,0.0005684239,0.00007283872,0.0002334995,0.0009482423,0.0001087242],"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.00018818,0.0001201287,0.00252138,0.00004390251,0.0003698496,0.00000195699,0.006556535,0.909777,0.07205099,0.001289366,0.00591324,0.001167441],"study_design_scores_gemma":[0.0009944388,0.0002132493,0.003100468,0.00004774204,0.00002611583,0.00003221603,0.0007548548,0.9820845,0.01217381,0.000168375,0.0003025348,0.0001017123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7691246,0.0002944269,0.2250879,0.002294337,0.0002230714,0.001792012,0.00003838742,0.00006852546,0.001076707],"genre_scores_gemma":[0.7726311,0.00003926025,0.2264124,0.0001123277,0.0003719101,0.00003112974,0.000003840369,0.00004295695,0.0003551056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07230745,"threshold_uncertainty_score":0.6330221,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07959455024081594,"score_gpt":0.3510110840672343,"score_spread":0.2714165338264184,"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."}}