{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T10:23:38Z","timestamp":1775125418237,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The traveling salesman problem (TSP) is an NP-hard problem. Thus far, a large number of researchers have proposed different ant colony optimization (ACO) algorithms to solve the TSP. These algorithms inevitably encounter problems such as long convergence time and the tendency to easily fall into local optima. On the basis of the ACO algorithm, this study proposes a dynamic adaptive ACO algorithm (DAACO). DAACO realizes the diversity of initialization of the ACO algorithm by dynamically determining the number of ants to be prevented from falling into local optimization. DAACO also adopts a hybrid local selection strategy to increase the quality of ant optimization and reduce the optimization time. Among the 20 instances of the TSPLIB dataset, the DAACO algorithm obtains 19 optimal values, and the solutions of 10 instances are better than those of other algorithms. The experimental results on the TSPLIB dataset show that the DAACO algorithm has obvious advantages in terms of convergence time, solution quality, and average value relative to existing state-of-the-art ACO algorithms.<\/jats:p>","DOI":"10.1007\/s40747-022-00949-6","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T03:02:32Z","timestamp":1672628552000},"page":"4317-4330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["DAACO: adaptive dynamic quantity of ant ACO algorithm to solve the traveling salesman problem"],"prefix":"10.1007","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9454-218X","authenticated-orcid":false,"given":"Huijun","family":"Liu","sequence":"first","affiliation":[]},{"given":"Ao","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Wenshi","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,2]]},"reference":[{"key":"949_CR1","doi-asserted-by":"publisher","unstructured":"Chen S-M, Chien C-Y (2010) A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. In: Proceedings of the ninth international conference on machine learning and cybernetics, Qingdao, 11\u201314 July 2010, vol 5. IEEE, pp 2477\u20132482. https:\/\/doi.org\/10.1109\/ICMLC.2010.5580809","DOI":"10.1109\/ICMLC.2010.5580809"},{"issue":"7","key":"949_CR2","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7):1659\u20131669. https:\/\/doi.org\/10.1007\/s00521-013-1402-2","journal-title":"Neural Comput Appl"},{"key":"949_CR3","doi-asserted-by":"publisher","unstructured":"Yang X-S (2010) A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010). Springer, Berlin, pp 65\u201374. https:\/\/doi.org\/10.1007\/978-3-642-12538-6_6","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"949_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang X-S, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371. https:\/\/doi.org\/10.1016\/j.engappai.2015.10.006","journal-title":"Eng Appl Artif Intell"},{"key":"949_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887","volume":"86","author":"M Akhand","year":"2020","unstructured":"Akhand M, Ayon SI, Shahriyar S, Siddique N, Adeli H (2020) Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput 86:105887. https:\/\/doi.org\/10.1016\/j.asoc.2019.105887","journal-title":"Appl Soft Comput"},{"key":"949_CR6","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput 44:428\u2013438. https:\/\/doi.org\/10.1016\/j.swevo.2018.05.006","journal-title":"Swarm Evol Comput"},{"key":"949_CR7","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.swevo.2018.08.004","volume":"44","author":"SS Choong","year":"2019","unstructured":"Choong SS, Wong L-P, Lim CP (2019) An artificial bee colony algorithm with a modified choice function for the traveling salesman problem. Swarm Evol Comput 44:622\u2013635. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.004","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"949_CR8","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.jestch.2019.11.005","volume":"23","author":"AC Cinar","year":"2020","unstructured":"Cinar AC, Korkmaz S, Kiran MS (2020) A discrete tree-seed algorithm for solving symmetric traveling salesman problem. Eng Sci Technol Int J 23(4):879\u2013890. https:\/\/doi.org\/10.1016\/j.jestch.2019.11.005","journal-title":"Eng Sci Technol Int J"},{"key":"949_CR9","doi-asserted-by":"publisher","unstructured":"Yousefikhoshbakht M (2021) Solving the traveling salesman problem: a modified metaheuristic algorithm. Complexity 2021:Article ID 6668345. https:\/\/doi.org\/10.1155\/2021\/6668345","DOI":"10.1155\/2021\/6668345"},{"issue":"2","key":"949_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the travelling salesman problem. Biosystems 43(2):73\u201381. https:\/\/doi.org\/10.1016\/S0303-2647(97)01708-5","journal-title":"Biosystems"},{"issue":"1","key":"949_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366. https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans Evol Comput"},{"key":"949_CR12","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.asoc.2014.09.031","volume":"25","author":"W Elloumi","year":"2014","unstructured":"Elloumi W, El Abed H, Abraham A, Alimi AM (2014) A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP. Appl Soft Comput 25:234\u2013241. https:\/\/doi.org\/10.1016\/j.asoc.2014.09.031","journal-title":"Appl Soft Comput"},{"issue":"1","key":"949_CR13","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.eswa.2014.07.054","volume":"42","author":"JB Escario","year":"2015","unstructured":"Escario JB, Jimenez JF, Giron-Sierra JM (2015) Ant colony extended: experiments on the travelling salesman problem. Expert Syst Appl 42(1):390\u2013410. https:\/\/doi.org\/10.1016\/j.eswa.2014.07.054","journal-title":"Expert Syst Appl"},{"issue":"6","key":"949_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.14257\/ijdta.2015.8.5.19","volume":"8","author":"Y Liu","year":"2015","unstructured":"Liu Y, Wang X (2015) Study on an improved ACO algorithm based on multi-strategy in solving function problem. Int J Database Theory Appl 8(6):223\u2013232. https:\/\/doi.org\/10.14257\/ijdta.2015.8.5.19","journal-title":"Int J Database Theory Appl"},{"issue":"4","key":"949_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.14257\/ijhit.2016.9.4.20","volume":"9","author":"P Duan","year":"2016","unstructured":"Duan P, Yong A (2016) Research on an improved ant colony optimization algorithm and its application. Int J Hybrid Inf Technol 9(4):223\u2013234. https:\/\/doi.org\/10.14257\/ijhit.2016.9.4.20","journal-title":"Int J Hybrid Inf Technol"},{"issue":"9","key":"949_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14257\/ijdta.2016.9.9.03","volume":"9","author":"W Lei","year":"2016","unstructured":"Lei W, Wang F (2016) Research on an improved ant colony optimization algorithm for solving traveling salesmen problem. Int J Database Theory Appl 9(9):25\u201336. https:\/\/doi.org\/10.14257\/ijdta.2016.9.9.03","journal-title":"Int J Database Theory Appl"},{"issue":"9","key":"949_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.14257\/ijhit.2016.9.9.30","volume":"9","author":"M Li","year":"2016","unstructured":"Li M, Wan Z (2016) Research on an improved ACO algorithm based on multi-strategy for solving TSP. Int J Hybrid Inf Technol 9(9):323\u2013334. https:\/\/doi.org\/10.14257\/ijhit.2016.9.9.30","journal-title":"Int J Hybrid Inf Technol"},{"issue":"3","key":"949_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.14257\/ijsip.2016.9.3.13","volume":"9","author":"Y Liu","year":"2016","unstructured":"Liu Y (2016) Research on the algorithm optimization of improved ant colony algorithm-LSACA. Int J Signal Process Image Process Pattern Recogn 9(3):143\u2013154. https:\/\/doi.org\/10.14257\/ijsip.2016.9.3.13","journal-title":"Int J Signal Process Image Process Pattern Recogn"},{"key":"949_CR19","doi-asserted-by":"publisher","unstructured":"Mavrovouniotis M, M\u00fcller FM, Yang S (2017) Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans Cybern 47(7):1743\u20131756. https:\/\/doi.org\/10.1109\/TCYB.2016.2556742","DOI":"10.1109\/TCYB.2016.2556742"},{"key":"949_CR20","doi-asserted-by":"publisher","unstructured":"Deng W, Zhao H, Zou L, Li G, Yang X, Wu D (2017) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21(15):4387\u20134398. https:\/\/doi.org\/10.1007\/s00500-016-2071-8","DOI":"10.1007\/s00500-016-2071-8"},{"key":"949_CR21","doi-asserted-by":"publisher","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem. Soft Comput 22(5):1669\u20131685. https:\/\/doi.org\/10.1007\/s00500-016-2432-3","DOI":"10.1007\/s00500-016-2432-3"},{"issue":"8","key":"949_CR22","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.3390\/s19081837","volume":"19","author":"F Dahan","year":"2019","unstructured":"Dahan F, El Hindi K, Mathkour H, AlSalman H (2019) Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem. Sensors 19(8):1837. https:\/\/doi.org\/10.3390\/s19081837","journal-title":"Sensors"},{"key":"949_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S (2020) Deaco: adopting dynamic evaporation strategy to enhance ACO algorithm for the traveling salesman problem. Eng Appl Artif Intell 92:103649. https:\/\/doi.org\/10.1016\/j.engappai.2020.103649","journal-title":"Eng Appl Artif Intell"},{"key":"949_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M (2020) Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput 97:106720. https:\/\/doi.org\/10.1016\/j.asoc.2020.106720","journal-title":"Appl Soft Comput"},{"key":"949_CR25","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Pro Lett 1:132\u2013133. https:\/\/doi.org\/10.1016\/0020-0190(72)90045-2","journal-title":"Inf Pro Lett"},{"key":"949_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125889","volume":"397","author":"PT An","year":"2021","unstructured":"An PT, Huyen PTT, Le NT (2021) A modified graham\u2019s convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set. Appl Math Comput 397:125889. https:\/\/doi.org\/10.1016\/j.amc.2020.125889","journal-title":"Appl Math Comput"},{"issue":"1","key":"949_CR27","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. J R Stat Soc Ser C (Appl Stat) 28(1):100\u2013108. https:\/\/doi.org\/10.2307\/2346830","journal-title":"J R Stat Soc Ser C (Appl Stat)"},{"issue":"4","key":"949_CR28","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00949-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00949-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00949-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T13:24:35Z","timestamp":1690464275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00949-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,2]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["949"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00949-6","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,2]]},"assertion":[{"value":"25 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}