{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004714756,0.0005968914,0.0009679994,0.0004838323,0.0003027516,0.001038676,0.001272554,0.001183766,0.01046749],"category_scores_gemma":[0.001818089,0.0003792911,0.0005775994,0.001094508,0.0004969034,0.001259494,0.0008229845,0.001885524,0.001369231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061219,"about_ca_system_score_gemma":0.0007927064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00152535,"about_ca_topic_score_gemma":0.001322789,"domain_scores_codex":[0.9997541,0.0000958698,0.000006280879,0.00003735843,0.00007876016,0.00002753398],"domain_scores_gemma":[0.9996582,0.0002306152,0.00002497663,0.00002038632,0.00003520134,0.00003061199],"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.0001125249,0.0001221393,0.0001953595,0.0003463328,0.00004041947,0.00007512453,0.00008114112,0.5734168,0.002223886,0.252975,0.02191711,0.1484941],"study_design_scores_gemma":[0.0000210505,0.00004495916,0.00007279041,0.00002717226,0.000008428762,0.00003344285,0.00002103164,0.942912,0.0002989882,0.04848322,0.008071431,0.000005534965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01580258,0.00234535,0.9380211,0.000942709,0.0003422784,0.00005788863,0.0002283247,0.0001998738,0.04205989],"genre_scores_gemma":[0.3785588,0.00493323,0.5443109,0.0004183699,0.0004833342,0.0003659398,0.000817516,0.0005017681,0.06961021],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01046749,"threshold_uncertainty_score":0.03501725,"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."}}