{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726737,0.0004779039,0.0007849801,0.000743548,0.0004942107,0.0005505783,0.001570628,0.0007130967,0.003186978],"category_scores_gemma":[0.002178494,0.0003107977,0.0006058583,0.0009328279,0.0004806852,0.0009991927,0.0006482014,0.0007164092,0.0004721613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007748281,"about_ca_system_score_gemma":0.001063604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004137759,"about_ca_topic_score_gemma":0.006299614,"domain_scores_codex":[0.9996921,0.0001059035,0.00001065821,0.00003611615,0.0001115208,0.00004373182],"domain_scores_gemma":[0.9996198,0.0002283687,0.0000369413,0.00003497996,0.00006027383,0.00001951478],"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.0001170469,0.0001011651,0.0005190209,0.0001591094,0.00004413167,0.0001074857,0.0001086001,0.7320433,0.003255403,0.02712605,0.003447466,0.2329713],"study_design_scores_gemma":[0.00003491342,0.00009991247,0.0002038659,0.00001593532,0.00002048346,0.00006662336,0.00002915643,0.9868841,0.001092722,0.008166801,0.003370969,0.00001460613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02873334,0.0005491984,0.9618491,0.0001133765,0.00006970113,0.0002341403,0.00009646986,0.0007403838,0.007614322],"genre_scores_gemma":[0.247144,0.0004037726,0.7480956,0.00009319978,0.00004008492,0.0004256773,0.0002998057,0.0002502464,0.003247574],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004137759,"threshold_uncertainty_score":0.01066148,"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."}}