{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T10:43:07Z","timestamp":1770374587715,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T00:00:00Z","timestamp":1769558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Artif Life Robotics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10015-025-01098-y","type":"journal-article","created":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:36:46Z","timestamp":1769575006000},"page":"280-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary multi-objective optimization with the heuristic solver for multiple traveling salesman problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Yoshiaki","family":"Katada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinya","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuhiro","family":"Ohkura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,28]]},"reference":[{"key":"1098_CR1","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"WJ Cook","year":"2012","unstructured":"Cook WJ (2012) In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton"},{"issue":"2","key":"1098_CR2","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J Comput 25(2):346\u2013363","journal-title":"INFORMS J Comput"},{"key":"1098_CR3","volume-title":"An Introduction to Ant Colony Optimization","author":"M Dorigo","year":"2007","unstructured":"Dorigo M, Socha K (2007) An Introduction to Ant Colony Optimization. Approximation Algorithms and Metaheuristics, CRC Press, Boca Raton"},{"issue":"3","key":"1098_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"4","key":"1098_CR5","first-page":"598","volume":"3","author":"S Amarbir","year":"2016","unstructured":"Amarbir S (2016) A Review on Algorithms Used to Solve Multiple Travelling Salesman Problem. Int Res J Eng Technol (IRJET) 3(4):598\u2013603","journal-title":"Int Res J Eng Technol (IRJET)"},{"key":"1098_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2021.100369","volume":"40","author":"O Cheikhrouhou","year":"2021","unstructured":"Cheikhrouhou O, Khoufi I (2021) A comprehensive Survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy. Computer Science Review 40:100369","journal-title":"Computer Science Review"},{"key":"1098_CR7","doi-asserted-by":"crossref","unstructured":"Vashisth A, Batth RS, Ward R (2021) Existing Path Planning Techniques in Unmanned Aerial Vehicles (UAVs): A Systematic Review. In: 2021 International Conference on Computational Intelligence and Knowledge Economy (ICCIKE), pp. 366\u2013372","DOI":"10.1109\/ICCIKE51210.2021.9410787"},{"issue":"12","key":"1098_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.3390\/aerospace8120363","volume":"8","author":"N Elmeseiry","year":"2021","unstructured":"Elmeseiry N, Alshaer N, Ismail T (2021) A Detailed Survey and Future Directions of Unmanned Aerial Vehicles (UAVs) with Potential Applications. Aerospace 8(12):363","journal-title":"Aerospace"},{"key":"1098_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00521-021-06569-4","volume":"34","author":"A Puente-Castro","year":"2022","unstructured":"Puente-Castro A, Rivero D, Pazos A, Fernandez-Blanco E (2022) A review of artificial intelligence applied to path planning in UAV swarms. Neural Comput Appl 34:153\u2013170","journal-title":"Neural Comput Appl"},{"issue":"21","key":"1098_CR10","doi-asserted-by":"publisher","first-page":"4019","DOI":"10.3390\/rs16214019","volume":"16","author":"D Debnath","year":"2024","unstructured":"Debnath D, Vanegas F, Sandino J, Hawary AF, Gonzalez F (2024) A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications. Remote Sens 16(21):4019","journal-title":"Remote Sens"},{"issue":"4","key":"1098_CR11","doi-asserted-by":"publisher","first-page":"2951","DOI":"10.1051\/ro\/2024073","volume":"58","author":"S Ghambari","year":"2024","unstructured":"Ghambari S, Golabi M, Jourdan L, Lepagnot J, Idoumghar L (2024) UAV Path Planning Techniques: A Survey. RAIRO Oper Res 58(4):2951\u20132989","journal-title":"RAIRO Oper Res"},{"key":"1098_CR12","doi-asserted-by":"crossref","unstructured":"Vandermeulen I, Gro\u00df R, Kolling A (2019) Balanced Task Allocation by Partitioning the Multiple Traveling Salesperson Problem, In Proc. of the 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019), pp.1479\u20131487","DOI":"10.65109\/MXOJ9814"},{"key":"1098_CR13","doi-asserted-by":"publisher","first-page":"6567","DOI":"10.1007\/s00500-017-2705-5","volume":"22","author":"X Xu","year":"2018","unstructured":"Xu X, Yuan H, Liptrott M, Trovati M (2018) Two Phase Heuristic Algorithm for The Multiple-traveling Salesman Problem. Soft Comput 22:6567\u20136581","journal-title":"Soft Comput"},{"key":"1098_CR14","unstructured":"Katada Y, Watanabe S, Ohkura K (2023) City Assignment by Multi-Objective Evolutionary Artificial Neural Networks for Multiple TSP, In: Proceedings of 2023 IEEE Symposium Series on Computational Intelligence (SSCI), pp.611\u2013612"},{"key":"1098_CR15","unstructured":"Katada Y, Watanabe S, Ohkura K (2024) Evolutionary Multi-objective Optimization of Artificial Neural Networks for Multiple TSP, In: Proceedings of the 8th International Symposium on Swarm Behavior and Bio-Inspired Robotics (SWARM2024), pp.67\u201374"},{"issue":"2","key":"1098_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2009","unstructured":"Li H, Zhang Q (2009) Multiobjective Optimization Problems With Complicated Pareto Sets. MOEA\/D and NSGA-II IEEE Transactions on Evolutionary Computation 13(2):284\u2013302","journal-title":"MOEA\/D and NSGA-II IEEE Transactions on Evolutionary Computation"},{"issue":"6","key":"1098_CR17","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"1098_CR18","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1109\/TEVC.2021.3076514","volume":"25","author":"L He","year":"2021","unstructured":"He L, Ishibuchi H, Trivedi A, Wang H, Nan Y, Srinivasan D (2021) A Survey of Normalization Methods in Multiobjective Evolutionary Algorithms. IEEE Trans Evol Comput 25(6):1028\u20131048","journal-title":"IEEE Trans Evol Comput"},{"key":"1098_CR19","unstructured":"TSPLIB, http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"},{"key":"1098_CR20","unstructured":"MOEA\/D -Resources, https:\/\/sites.google.com\/view\/moead\/resources"},{"key":"1098_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun K (2009) General $$k$$-opt submoves for the Lin-Kernighan TSP heuristic. Math Program Comput 1:119\u2013163","journal-title":"Math Program Comput"},{"key":"1098_CR22","unstructured":"LKH-2.0.9 URL:http:\/\/webhotel4.ruc.dk\/$$^{\\sim }$$keld\/research\/LKH\/"}],"container-title":["Artificial Life and Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-025-01098-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10015-025-01098-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10015-025-01098-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T19:46:33Z","timestamp":1770320793000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10015-025-01098-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,28]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1098"],"URL":"https:\/\/doi.org\/10.1007\/s10015-025-01098-y","relation":{},"ISSN":["1433-5298","1614-7456"],"issn-type":[{"value":"1433-5298","type":"print"},{"value":"1614-7456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,28]]},"assertion":[{"value":"12 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}