{"id":"W3016159714","doi":"10.1111/itor.12797","title":"Solving the clustered traveling salesman problem with ‐relaxed priority rule","year":2020,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Iterated local search; Mathematical optimization; Computer science; Class (philosophy); Iterated function; Traveling purchaser problem; 2-opt; Constraint (computer-aided design); Integer (computer science); Metaheuristic; Mathematics; 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.001044802,0.0008740283,0.001377588,0.0005555602,0.0005379687,0.001174657,0.001718123,0.001386042,0.003324339],"category_scores_gemma":[0.001932802,0.0005261911,0.001132855,0.0009002335,0.0004837167,0.001095375,0.0007545347,0.001166033,0.0002889826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007115795,"about_ca_system_score_gemma":0.001570405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0105721,"about_ca_topic_score_gemma":0.005466645,"domain_scores_codex":[0.9992715,0.0002252958,0.00004753661,0.0001550044,0.0001411387,0.0001595263],"domain_scores_gemma":[0.9989501,0.0005561115,0.0001181934,0.0000859102,0.0002105126,0.00007920194],"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.00008497515,0.00009803272,0.0003973937,0.00008604152,0.00004372186,0.0001115479,0.00004412953,0.9696882,0.001604049,0.008062906,0.001107512,0.01867142],"study_design_scores_gemma":[0.00001613457,0.00003089313,0.00004860867,0.000003613921,0.000005885586,0.00001508391,0.00001754816,0.9970031,0.0003236642,0.002306775,0.0002245504,0.000004080226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08667408,0.0002781743,0.9070626,0.0002611001,0.00008573942,0.0001411493,0.0001199389,0.0002690889,0.005108162],"genre_scores_gemma":[0.6646601,0.0002194118,0.3305668,0.0001173338,0.00005504153,0.0001686,0.0002913389,0.00008220286,0.003839191],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0105721,"threshold_uncertainty_score":0.02102113,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07497900821825791,"score_gpt":0.3582295158604328,"score_spread":0.2832505076421749,"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."}}