{"id":"W2155293443","doi":"10.1016/j.cor.2013.08.010","title":"A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":160,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Benchmark (surveying); Vehicle routing problem; Heuristic; Computer science; Mathematical optimization; Variable (mathematics); Variable neighborhood search; Ant colony optimization algorithms; Algorithm; Routing (electronic design automation); Metaheuristic; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001876893,0.000200679,0.000216173,0.0001963322,0.001152251,0.0008600499,0.0005909062,0.00006329152,0.0001616735],"category_scores_gemma":[0.0003085537,0.0001524418,0.00004598447,0.0007970293,0.0001338072,0.000390869,0.0001834995,0.0005794124,0.0002312158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001666541,"about_ca_system_score_gemma":0.0001922602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002424476,"about_ca_topic_score_gemma":0.00001167202,"domain_scores_codex":[0.9976072,0.0003610522,0.0003399272,0.000376298,0.0005121226,0.0008033537],"domain_scores_gemma":[0.9962227,0.002112241,0.00001456331,0.0005772913,0.00090787,0.0001652988],"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.000009341153,0.00004054322,0.0002462963,0.0000454807,0.0000675521,0.000001385929,0.0004798072,0.9843534,0.003224608,0.0007821207,0.002880949,0.007868571],"study_design_scores_gemma":[0.000763701,0.0001131308,0.0003987081,0.00006050945,0.0000109784,0.00001262973,0.0001185846,0.9964517,0.001259858,0.0000786027,0.0005360142,0.000195627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0215942,0.00009509768,0.9735874,0.000743091,0.00009516264,0.002702063,0.00002079939,0.0003174507,0.0008447162],"genre_scores_gemma":[0.6447034,0.000009417459,0.3535389,0.00005072931,0.0001876026,0.0007305302,0.00004048554,0.00008038732,0.0006585717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6231092,"threshold_uncertainty_score":0.8862299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03028985025965375,"score_gpt":0.2943681629263528,"score_spread":0.264078312666699,"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."}}