{"id":"W2074030523","doi":"10.1007/s11590-014-0788-9","title":"A general variable neighborhood search variants for the travelling salesman problem with draft limits","year":2014,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Traveling purchaser problem; Variable neighborhood search; Descent (aeronautics); 2-opt; Mathematical optimization; Computational intelligence; Variable (mathematics); Set (abstract data type); Computer science; Limit (mathematics); Extension (predicate logic); Bottleneck traveling salesman problem; Context (archaeology); Mathematics; Metaheuristic; Artificial intelligence","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.001964245,0.0007054389,0.001129164,0.0006703541,0.0005333259,0.001616187,0.002412167,0.001671933,0.004967948],"category_scores_gemma":[0.005123065,0.0005109186,0.001147146,0.001140883,0.001037619,0.002507144,0.001637098,0.00186857,0.0005376007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009987711,"about_ca_system_score_gemma":0.001135204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004137387,"about_ca_topic_score_gemma":0.003088613,"domain_scores_codex":[0.9992315,0.0003900217,0.00002391037,0.0001322507,0.0001581988,0.00006415085],"domain_scores_gemma":[0.9987697,0.0007178618,0.0001064131,0.0001194135,0.000201557,0.00008499857],"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.00008122796,0.00007299422,0.0003805505,0.0001084572,0.00004464644,0.000122739,0.00008022277,0.6408227,0.0009176825,0.3284853,0.004887786,0.02399582],"study_design_scores_gemma":[0.000009532207,0.00002295535,0.00005530544,0.000008139345,0.000006031769,0.00002622866,0.00001130024,0.9648449,0.00009626526,0.03291005,0.002003288,0.000006052622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01811799,0.0008594999,0.9665614,0.0005997244,0.000186154,0.00005611125,0.0001043702,0.0000598033,0.01345486],"genre_scores_gemma":[0.4666399,0.001835817,0.4842966,0.0003593227,0.0003765328,0.0003986512,0.0005028224,0.0003345752,0.0452558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004967948,"threshold_uncertainty_score":0.0166195,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01278262418791783,"score_gpt":0.225733239364,"score_spread":0.2129506151760822,"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."}}