{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:05:25Z","timestamp":1781021125804,"version":"3.54.1"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.asoc.2026.115482","type":"journal-article","created":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T14:51:13Z","timestamp":1779029473000},"page":"115482","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A multi-pheromone ant colony optimization for large-scale traveling salesman problems"],"prefix":"10.1016","volume":"200","author":[{"given":"Qunfeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qingnan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kanghua","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiarui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.asoc.2026.115482_bib0005","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","article-title":"Well-solvable special cases of the traveling salesman problem: a survey","volume":"40","author":"Burkard","year":"1998","journal-title":"SIAM Rev."},{"key":"10.1016\/j.asoc.2026.115482_bib0010","series-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"Cook","year":"2012"},{"key":"10.1016\/j.asoc.2026.115482_bib0015","series-title":"Optimization, Learning and Natural Algorithms","author":"Dorigo","year":"1992"},{"issue":"6","key":"10.1016\/j.asoc.2026.115482_bib0020","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-024-40490-y","article-title":"A survey on deep learning-based algorithms for the traveling salesman problem","volume":"19","author":"Sui","year":"2025","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.asoc.2026.115482_bib0025","series-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2011"},{"issue":"1","key":"10.1016\/j.asoc.2026.115482_bib0030","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","article-title":"An effective implementation of the lin-kernighan traveling salesman heuristic","volume":"126","author":"Helsgaun","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115482_bib0035","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","article-title":"General k-opt submoves for the lin-kernighan TSP heuristic","volume":"1","author":"Helsgaun","year":"2009","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0040","series-title":"An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems","author":"Helsgaun","year":"2017"},{"issue":"2","key":"10.1016\/j.asoc.2026.115482_bib0045","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","article-title":"A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem","volume":"25","author":"Nagata","year":"2013","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109339","article-title":"A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem","volume":"127","author":"Zhang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106249","article-title":"A reinforced hybrid genetic algorithm for the traveling salesman problem","volume":"157","author":"Zheng","year":"2023","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115482_bib0060","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: a cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.108653","article-title":"Improving ant colony optimization efficiency for solving large TSP instances","volume":"120","author":"Skinderowicz","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0070","series-title":"Combinatorial Optimization: Theory and Algorithms","author":"Korte","year":"2018"},{"issue":"1","key":"10.1016\/j.asoc.2026.115482_bib0075","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling-salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.asoc.2026.115482_bib0080","first-page":"393","article-title":"Solution of a large-scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115482_bib0085","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"6","key":"10.1016\/j.asoc.2026.115482_bib0090","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115482_bib0095","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2026.115482_bib0100","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1527\/tjsai.22.542","article-title":"Fast implementation of genetic algorithm by localized EAX crossover for the traveling salesman problem","volume":"22","author":"Nagata","year":"2007","journal-title":"Trans. Jpn. Soc. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115482_bib0105","series-title":"Proceedings of the 35th International Conference on Neural Information Processing Systems","first-page":"572","article-title":"NeuroLKH: combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem","author":"Xin","year":"2021"},{"issue":"8","key":"10.1016\/j.asoc.2026.115482_bib0110","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN ant system","volume":"16","author":"St\u00fctzle","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.asoc.2026.115482_bib0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.104131","article-title":"ACOTSP-MF: a memory-friendly and highly scalable ACOTSP approach","volume":"99","author":"Mart\u00ednez","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.asoc.2026.115482_bib0120","series-title":"Proceedings of the 4th International Conference on Computational Collective Intelligence: Technologies and Applications-Volume Part II","article-title":"Ant colony system with selective pheromone memory for TSP","author":"Skinderowicz","year":"2013"},{"key":"10.1016\/j.asoc.2026.115482_bib0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107439","article-title":"Ant colony optimization for traveling salesman problem based on parameters optimization","volume":"107","author":"Wang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2022.109943","article-title":"Heuristic smoothing ant colony optimization with differential information for the traveling salesman problem","volume":"133","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0135","series-title":"Ant Colony Optimization","author":"Dorigo","year":"2004"},{"issue":"3","key":"10.1016\/j.asoc.2026.115482_bib0140","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/j.ejor.2007.04.037","article-title":"Combining two pheromone structures for solving the car sequencing problem with ant colony optimization","volume":"191","author":"Solnon","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115482_bib0145","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s00500-019-03933-4","article-title":"A multiple pheromone ant colony optimization scheme for energy-efficient wireless sensor networks","author":"Arora","year":"2020","journal-title":"Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115482_bib0150","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1016\/j.ijpe.2012.10.011","article-title":"Flexible job shop scheduling with due window\u2014a two-pheromone ant colony approach","volume":"141","author":"Huang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115482_bib0155","doi-asserted-by":"crossref","first-page":"148721","DOI":"10.1109\/ACCESS.2021.3124386","article-title":"A multiple pheromone communication system for swarm intelligence","volume":"9","author":"Liu","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.asoc.2026.115482_bib0160","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.swevo.2016.06.006","article-title":"Effective heuristics for ant colony optimization to handle large-scale problems","volume":"32","author":"Ismkhan","year":"2017","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0165","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.future.2020.01.011","article-title":"Implementing a GPU-based parallel MAX-MIN ant system","volume":"106","author":"Skinderowicz","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.asoc.2026.115482_bib0170","series-title":"International Conference on Computational Collective Intelligence","first-page":"41","article-title":"Enhancing focused ant colony optimization for large-scale traveling salesman problems through adaptive parameter tuning","author":"Skinderowicz","year":"2024"},{"key":"10.1016\/j.asoc.2026.115482_bib0175","unstructured":"W. Cook, TSP art instances. Accessed: [2025\/12\/1]. [Online]. Available: https:\/\/www.math.uwaterloo.ca\/tsp\/data\/art"},{"key":"10.1016\/j.asoc.2026.115482_bib0180","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s12532-020-00184-5","article-title":"Hard to solve instances of the euclidean traveling salesman problem","volume":"13","author":"Hougardy","year":"2021","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.asoc.2026.115482_bib0185","unstructured":"K. Helsgaun, Best LKH solutions for tnm instances. [Online]. Available: http:\/\/webhotel4.ruc.dk\/keld\/research\/LKH\/Best%20LKH%20solutions%20for%20Tnm%20instances.pdf (Accessed: 1 December 2025)."},{"key":"10.1016\/j.asoc.2026.115482_bib0190","series-title":"Proceedings of the IEEE Congress on Evolutionary Computation","first-page":"1278","article-title":"A parallel genetic algorithm with edge assembly crossover for 100, 000-city scale TSPs","author":"Honda","year":"2013"},{"key":"10.1016\/j.asoc.2026.115482_bib0195","series-title":"Using POPMUSIC for Candidate Set Generation in the Lin-Kernighan-Helsgaun TSP Solver","author":"Helsgaun","year":"2018"}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626009300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:54:27Z","timestamp":1781020467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626009300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":39,"alternative-id":["S1568494626009300"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115482","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A multi-pheromone ant colony optimization for large-scale traveling salesman problems","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115482","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115482"}}