{"id":"W4412742817","doi":"10.1109/rait65068.2025.11088949","title":"Optimized Travelling Salesman Problem Solution Using 1-Tree Approach","year":2025,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Future Earth","funders":"","keywords":"Travelling salesman problem; Computer science; Mathematical 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.0004304887,0.0006763848,0.0008784157,0.0009423425,0.000559605,0.001067429,0.000884501,0.001326501,0.006633171],"category_scores_gemma":[0.00103341,0.0003325688,0.0009196737,0.00111827,0.000258097,0.0009688155,0.0005843148,0.0007866919,0.0007693417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006843161,"about_ca_system_score_gemma":0.001481455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005514293,"about_ca_topic_score_gemma":0.005122602,"domain_scores_codex":[0.9997731,0.00007952449,0.00001006223,0.00003916556,0.0000450224,0.00005313067],"domain_scores_gemma":[0.9997994,0.0001138455,0.00002248805,0.000009108447,0.00004032087,0.00001478266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006209092,0.00008709617,0.0004346824,0.0002061984,0.00004796655,0.0001325885,0.00008285593,0.8932256,0.001388455,0.03579795,0.005605297,0.0629291],"study_design_scores_gemma":[0.000009617956,0.00003579245,0.00008212913,0.00001180522,0.000009054737,0.00002811373,0.00003043131,0.9910333,0.0001949694,0.007005723,0.001554227,0.000004866507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03817374,0.001462132,0.9299652,0.0006452824,0.0001773907,0.0001688331,0.0002505413,0.0003722752,0.02878457],"genre_scores_gemma":[0.393892,0.001929099,0.58966,0.0003071695,0.0001072207,0.0002895344,0.0006953443,0.0001970048,0.0129226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006633171,"threshold_uncertainty_score":0.02219015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04360007449496314,"score_gpt":0.3047839233212758,"score_spread":0.2611838488263127,"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."}}