{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000812923,0.0004896174,0.001079723,0.0008526455,0.0005628625,0.0008218999,0.001936116,0.001380148,0.00413086],"category_scores_gemma":[0.001628513,0.0005471861,0.0006587483,0.001203688,0.0003630324,0.000874974,0.0006756384,0.0006269248,0.0005163584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008169961,"about_ca_system_score_gemma":0.001071747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006544632,"about_ca_topic_score_gemma":0.006489536,"domain_scores_codex":[0.9996321,0.0001475496,0.00001429491,0.00004223901,0.0001084609,0.00005528917],"domain_scores_gemma":[0.99943,0.0003319492,0.00004643226,0.00004404729,0.0001125135,0.00003505161],"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.0002085865,0.0001316221,0.0003646872,0.0000750516,0.00006130734,0.00005712021,0.00004240092,0.9025411,0.001903355,0.005065002,0.001983508,0.08756626],"study_design_scores_gemma":[0.00003320029,0.00005507213,0.00008442706,0.000005344225,0.00001114612,0.00001346269,0.000008408591,0.9982411,0.0002571799,0.0007564721,0.0005290196,0.000005178368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09658539,0.0012168,0.8902723,0.0002553068,0.0002626751,0.0001819536,0.000188721,0.0008581491,0.01017874],"genre_scores_gemma":[0.4969328,0.0003638617,0.4957435,0.0001901752,0.00007664526,0.0003673216,0.0002628571,0.0002185706,0.005844247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006544632,"threshold_uncertainty_score":0.01381916,"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."}}