{"id":"W3206167478","doi":"10.1155/2021/6642009","title":"An Improved Ant Colony Optimization Based on an Adaptive Heuristic Factor for the Traveling Salesman Problem","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Travelling salesman problem; Ant colony optimization algorithms; Mathematical optimization; Heuristic; Computer science; Population; Path (computing); Algorithm; Local optimum; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006686348,0.0001591512,0.0002396478,0.0001333452,0.0002201743,0.0001551216,0.0004735831,0.00006279047,0.00002501846],"category_scores_gemma":[0.0002019299,0.0001229853,0.0001096556,0.000456883,0.00003433242,0.001000981,0.000002993355,0.0002385963,4.666993e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007999911,"about_ca_system_score_gemma":0.0004627215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000235856,"about_ca_topic_score_gemma":0.00002480014,"domain_scores_codex":[0.9981271,0.0002071035,0.0006389751,0.0003130419,0.0004850744,0.0002286925],"domain_scores_gemma":[0.9968145,0.0005739762,0.0005103796,0.0003484473,0.001583776,0.0001688873],"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.0002914141,0.0002106657,0.00001616255,0.00002150458,0.0000229284,0.0000215757,0.0007468695,0.9769302,0.002677433,0.0006687031,0.000002982241,0.01838955],"study_design_scores_gemma":[0.001548092,0.001572321,0.005201637,0.00004669739,0.00003681421,0.000006046088,0.0002176978,0.988576,0.002231616,0.0003512535,0.00007199506,0.0001398473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002976053,0.00005113105,0.9955314,0.0005170518,0.0003443666,0.0004897765,0.0000481491,0.00003081683,0.00001124934],"genre_scores_gemma":[0.3948524,0.00004320569,0.6048036,0.000124337,0.0000802953,0.00001962479,0.00004484598,0.00001728361,0.00001438145],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3918764,"threshold_uncertainty_score":0.5015195,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02340333666728168,"score_gpt":0.3020226378480316,"score_spread":0.27861930118075,"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."}}