{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005650198,0.0008914435,0.00108652,0.001041068,0.0005074288,0.000700058,0.001400077,0.0009898518,0.001742401],"category_scores_gemma":[0.00193186,0.0002885707,0.001038415,0.001174247,0.0004059376,0.0008104321,0.0006487024,0.0008443422,0.0003625101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005272793,"about_ca_system_score_gemma":0.00117014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009445408,"about_ca_topic_score_gemma":0.00707545,"domain_scores_codex":[0.9994754,0.0001366342,0.00002576928,0.00009420655,0.0001951034,0.0000728067],"domain_scores_gemma":[0.9995229,0.0001801832,0.00005557492,0.00004219478,0.0001632355,0.00003590952],"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.0001223351,0.0001143456,0.00122311,0.0001610427,0.0001071388,0.0001999642,0.00008470975,0.8326376,0.006272213,0.00890515,0.004020749,0.1461517],"study_design_scores_gemma":[0.00002955678,0.00004551207,0.0001555841,0.000005249061,0.00001654769,0.00005551549,0.000008864834,0.9966676,0.0004672113,0.00100708,0.001532364,0.000008839609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03949796,0.001143198,0.9485952,0.0002453851,0.0002788063,0.0001773052,0.00007560133,0.0007419201,0.009244584],"genre_scores_gemma":[0.6248742,0.0008397721,0.3682099,0.0002347573,0.0001377453,0.0002961693,0.000253808,0.0001887655,0.004964905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009445408,"threshold_uncertainty_score":0.01878083,"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."}}