{"id":"W2993393857","doi":"10.1109/kse.2019.8919421","title":"On the Traveling Salesman Problem with Hierarchical Objective Function","year":2019,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Computer science; 2-opt; Traveling purchaser problem; Genetic algorithm; Transformation (genetics); Function (biology); Bottleneck traveling salesman problem; Lin–Kernighan heuristic; Group (periodic table); 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.001009658,0.001210703,0.0009634789,0.0007541839,0.0005952016,0.0009463315,0.001141332,0.001249721,0.006259018],"category_scores_gemma":[0.001850846,0.0004145231,0.0009600171,0.0016326,0.0008327405,0.001633462,0.001097835,0.001449922,0.000700103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144167,"about_ca_system_score_gemma":0.00118526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007770575,"about_ca_topic_score_gemma":0.004337145,"domain_scores_codex":[0.9993043,0.0002919775,0.00002359986,0.0001381819,0.0001314192,0.0001105648],"domain_scores_gemma":[0.9994909,0.0002990204,0.00006098744,0.00003393336,0.00007115393,0.00004400496],"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.00005087136,0.0000872322,0.0003471492,0.0001814235,0.00004346518,0.0001631891,0.00006552078,0.8947051,0.0009654836,0.06843972,0.00330301,0.03164789],"study_design_scores_gemma":[0.00001405349,0.00004462095,0.000124408,0.00001155918,0.00001235555,0.00004162582,0.00002582622,0.9754091,0.0002232327,0.0217777,0.002305746,0.000009695952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02563459,0.001382251,0.9596979,0.0005498284,0.0001129509,0.0001072642,0.0001918585,0.0001385049,0.01218489],"genre_scores_gemma":[0.5591385,0.003472912,0.4185684,0.0003620058,0.0003562679,0.0003039763,0.0006416006,0.0001823355,0.01697406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007770575,"threshold_uncertainty_score":0.02093852,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008224644849638498,"score_gpt":0.2078611937827773,"score_spread":0.1996365489331388,"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."}}