{"id":"W2107306858","doi":"10.1007/s10732-006-4192-1","title":"Path relinking for the vehicle routing problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Norges Forskningsråd","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Path (computing); Vehicle routing problem; Hill climbing; Mathematics; Local search (optimization); Heuristic; Local optimum; Travelling salesman problem; Routing (electronic design automation); Computer science","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.001779798,0.001024699,0.001324356,0.001057283,0.0008151061,0.001156192,0.001677001,0.001143581,0.005312195],"category_scores_gemma":[0.006626944,0.0007721158,0.0008464669,0.001435192,0.001190556,0.002521786,0.001463507,0.002671835,0.0005496618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009012,"about_ca_system_score_gemma":0.001731702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006244975,"about_ca_topic_score_gemma":0.004995558,"domain_scores_codex":[0.9990445,0.0004996003,0.00003301393,0.0001230877,0.0001580574,0.0001417892],"domain_scores_gemma":[0.997016,0.002299481,0.0001845077,0.0001663365,0.0002022381,0.0001314586],"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.0002203382,0.0001236772,0.0004099003,0.0002276607,0.0000436619,0.00006205672,0.0001200362,0.8871408,0.0008851888,0.04221092,0.003301622,0.06525416],"study_design_scores_gemma":[0.00004734464,0.00008293196,0.0001085363,0.00002845175,0.00002390067,0.00003671761,0.00005220068,0.9496762,0.0004008213,0.04794854,0.001582682,0.00001170835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05124215,0.001353053,0.9378989,0.0006727147,0.0001575284,0.0001609178,0.0001964129,0.0002584002,0.00805993],"genre_scores_gemma":[0.4354856,0.002048567,0.5519205,0.0001948588,0.0001483692,0.0002627659,0.0004865567,0.0002948764,0.009157876],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006244975,"threshold_uncertainty_score":0.01777107,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01283746988427042,"score_gpt":0.2482447645795565,"score_spread":0.235407294695286,"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."}}