{"id":"W3106774124","doi":"10.1007/978-3-030-63833-7_3","title":"Discrete Mother Tree Optimization for the Traveling Salesman Problem","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Travelling salesman problem; Swap (finance); Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Swarm behaviour; Particle swarm optimization; Combinatorial optimization; Tree (set theory); Algorithm; Mathematics; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001251689,0.000465193,0.0004546847,0.0003691521,0.0004685429,0.001028453,0.004310319,0.0002208847,0.00004473037],"category_scores_gemma":[0.0003017443,0.0003372387,0.0001623893,0.0008059626,0.0005644437,0.000441624,0.0009784504,0.0006697658,0.00002303519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001774694,"about_ca_system_score_gemma":0.0005903668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000821759,"about_ca_topic_score_gemma":0.00002122005,"domain_scores_codex":[0.9960174,0.00005651489,0.0005944999,0.001490558,0.001231057,0.0006099623],"domain_scores_gemma":[0.9966363,0.001206198,0.0002991738,0.001236801,0.0004261294,0.0001954504],"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.000005022402,0.000006854006,0.000001850548,0.00003033407,0.00001319451,0.000006677845,0.0003201478,0.6813256,0.000006535773,0.01564834,0.00003055929,0.3026049],"study_design_scores_gemma":[0.0002911075,0.0001176931,0.000005789514,0.0001079614,0.00001261267,0.00001333932,2.101698e-7,0.9627813,0.0001131498,0.03468174,0.001496899,0.0003781823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[1.607743e-7,0.0002669705,0.98896,0.005887548,0.0007300407,0.001398185,0.00001144127,0.0001494731,0.002596163],"genre_scores_gemma":[0.001615331,0.00008504761,0.9957445,0.001196281,0.0005133125,0.00005623341,0.0000123076,0.00006057658,0.0007164309],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3022268,"threshold_uncertainty_score":0.999908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02949725858594019,"score_gpt":0.2749360687940159,"score_spread":0.2454388102080758,"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."}}