{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002584202,0.0000953455,0.00008107186,0.00003206741,0.00004950209,0.00002797264,0.00006770867,0.00004461328,0.0002459601],"category_scores_gemma":[0.00001646868,0.00005636461,0.00002136154,0.0001742132,0.00001557931,0.0000509159,0.000008313266,0.0002247036,0.0001342096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003574481,"about_ca_system_score_gemma":0.00001079315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002886262,"about_ca_topic_score_gemma":0.000003806655,"domain_scores_codex":[0.9994594,0.00004216919,0.00009597227,0.0001287239,0.000130572,0.0001430988],"domain_scores_gemma":[0.9995284,0.00023703,0.00001372229,0.0001660795,0.0000265386,0.00002819692],"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.00003223313,0.0000105941,0.0007643905,0.00001465852,0.00003611528,3.778283e-7,0.0003024423,0.9578508,0.001316742,0.03676113,0.0001218609,0.002788642],"study_design_scores_gemma":[0.0004897838,0.000249679,0.006745205,0.00005777826,0.00001717502,0.000006620327,0.0002316927,0.9853273,0.003685341,0.002658704,0.0002960924,0.0002346101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3705371,0.000004756662,0.5320581,0.0001558231,0.0001058772,0.0003051882,5.822253e-7,0.0004100201,0.09642249],"genre_scores_gemma":[0.9636189,0.000001433832,0.03540103,0.0001390083,0.00003298546,0.00001460706,0.000002033818,0.00003114817,0.0007588093],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5930818,"threshold_uncertainty_score":0.2693091,"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."}}