{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:25:24Z","timestamp":1770495924918,"version":"3.49.0"},"reference-count":30,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":55,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2025,3,24]]},"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>In the process of solving the Traveling Salesman Problem (TSP), both the Ant Colony Optimization and Simulated Annealing Algorithm exhibit different limitations depending on the dataset. This paper aims to address these limitations by Using the Ant Colony Optimization as a search strategy for the Simulated Annealing algorithm and designs two adaptive search stages based on the search characteristics of the Simulated Annealing algorithm. Thus solving the problem of slow convergence speed and easy getting stuck in local optimal solutions in the Simulated Annealing algorithm. By conducting tests on various TSPLIB datasets, the algorithm proposed in this article demonstrates improved convergence speed and solution quality compared to traditional algorithms. Furthermore, it exhibits certain advantages over other existing improved algorithms.<\/jats:p>","DOI":"10.1051\/ro\/2025031","type":"journal-article","created":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:21:58Z","timestamp":1742952118000},"page":"1199-1213","source":"Crossref","is-referenced-by-count":3,"title":["The adaptive two-stage ant colony Simulated Annealing Algorithm for solving the Traveling Salesman Problem"],"prefix":"10.1051","volume":"59","author":[{"given":"Yingnian","family":"Wu","sequence":"first","affiliation":[]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Manhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hao","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Ding","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Meiqi","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"104061","DOI":"10.1016\/j.engappai.2020.104061","volume":"97","author":"Hu","year":"2021","journal-title":"Eng. App. Artif. Intell."},{"key":"R2","first-page":"115","volume":"26","author":"Li","year":"2021","journal-title":"J. China Agr. Univ."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/j.procs.2015.08.150","volume":"60","author":"Katagiri","year":"2015","journal-title":"Proc. Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1038\/s41467-017-00039-z","volume":"8","author":"Liu","year":"2017","journal-title":"Nat. Commun."},{"key":"R5","doi-asserted-by":"crossref","first-page":"102493","DOI":"10.1016\/j.omega.2021.102493","volume":"104","author":"Dell\u2019Amico","year":"2021","journal-title":"Omega"},{"key":"R6","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1002\/net.21864","volume":"72","author":"Bouman","year":"2018","journal-title":"Networks"},{"key":"R7","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.trc.2019.11.003","volume":"110","author":"Murray","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"R8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1239\/jap\/1395771417","volume":"51","author":"Bandyopadhyay","year":"2014","journal-title":"J. Appl. Probab."},{"key":"R9","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/moor.2019.1002","volume":"45","author":"Paul","year":"2020","journal-title":"Math. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"17057","DOI":"10.1007\/s00521-021-06298-8","volume":"33","author":"Dong","year":"2021","journal-title":"Neural Comput. App."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Jati G.K. and Suyanto , Evolutionary discrete firefly algorithm for travelling salesman problem, in International Conference on Adaptive and Intelligent Systems. Springer (2011) 393\u2013403.","DOI":"10.1007\/978-3-642-23857-4_38"},{"key":"R12","doi-asserted-by":"crossref","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","volume":"105","author":"Panwar","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1007\/s00500-014-1322-9","volume":"19","author":"Ouaarab","year":"2015","journal-title":"Soft Comput."},{"key":"R14","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Saji","year":"2016","journal-title":"Neural Comput. App."},{"key":"R15","doi-asserted-by":"crossref","first-page":"4451","DOI":"10.1007\/s12190-023-01935-y","volume":"69","author":"Akram","year":"2023","journal-title":"J. Appl. Math. Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"Stutzle","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"R17","first-page":"147","volume":"12","author":"Li-hua","year":"2019","journal-title":"Mach. Des. Manuf."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Amara J., Hamdani T.M. and Alimi A.M., A new hybrid discrete bat algorithm for traveling salesman problem using ordered crossover and 3-opt operators for bat\u2019s local search, in 2015 15th International Conference on Intelligent Systems Design and Applications (ISDA). IEEE (2015) 154\u2013159.","DOI":"10.1109\/ISDA.2015.7489217"},{"key":"R19","first-page":"219","volume":"33","author":"He","year":"2018","journal-title":"Control Decis."},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Chen X., Research on network optimization based on simulated annealing genetic algorithm, in 2017 5th International Conference on Machinery, Materials and Computing Technology (ICMMCT 2017). Atlantis Press (2017) 1349\u20131354.","DOI":"10.2991\/icmmct-17.2017.260"},{"key":"R21","first-page":"843","volume":"24","author":"Peng","year":"2009","journal-title":"Control Decis."},{"key":"R22","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1504\/IJCSM.2015.071818","volume":"6","author":"Wang","year":"2015","journal-title":"Int. J. Comput. Sci. Math."},{"key":"R23","first-page":"261","volume":"35","author":"Yuan","year":"2018","journal-title":"Comput. App. Softw."},{"key":"R24","unstructured":"Colorni A., Dorigo M. and Maniezzo V., Distributed optimization by ant colonies, in Proceedings of the First European Conference on Artificial Life. Vol. 142. Paris, France (1991) 134\u2013142."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"R26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1752","DOI":"10.1109\/21.256552","volume":"23","author":"Lin","year":"1993","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"R28","doi-asserted-by":"crossref","first-page":"e1609","DOI":"10.7717\/peerj-cs.1609","volume":"9","author":"Hao","year":"2023","journal-title":"PeerJ Comput. Sci."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"Qian H. and Su T., Hybrid algorithm based on max and min ant system and particle swarm optimization for solving TSP problem, in 2018 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC). IEEE (2018) 683\u2013687.","DOI":"10.1109\/YAC.2018.8406459"},{"key":"R30","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T07:49:24Z","timestamp":1745567364000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":30,"journal-issue":{"issue":"2"},"alternative-id":["ro240278"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2025031","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}