{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T12:09:31Z","timestamp":1769861371836,"version":"3.49.0"},"reference-count":8,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T00:00:00Z","timestamp":1765670400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,14]]},"DOI":"10.1109\/comcomap68359.2025.11353146","type":"proceedings-article","created":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:19:25Z","timestamp":1769721565000},"page":"30-35","source":"Crossref","is-referenced-by-count":0,"title":["Multiple Population Adaptive Memetic Algorithm for Solving the Traveling Salesman Problem"],"prefix":"10.1109","author":[{"given":"Renqi","family":"Zhu","sequence":"first","affiliation":[{"name":"National University of Defense Technology,College of Systems Engineering,Changsha,China"}]},{"given":"Anqi","family":"Ye","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,College of Systems Engineering,Changsha,China"}]},{"given":"Lin","family":"Pan","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,College of Systems Engineering,Changsha,China"}]},{"given":"Yun","family":"Zhou","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,College of Systems Engineering,Changsha,China"}]},{"given":"LIN","family":"Xiang","sequence":"additional","affiliation":[{"name":"National University of Defense Technology,College of Systems Engineering,Changsha,China"}]}],"member":"263","reference":[{"issue":"3","key":"ref1","first-page":"819","article-title":"A comprehensive survey on the generalized traveling salesman problem","volume-title":"European Journal of Operational Research","volume":"314","author":"Pop","year":"2024"},{"key":"ref2","volume-title":"An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems: Technical report.","author":"Helsgaun","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzae019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.05.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57802-2_51"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/jmse12020223"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/21.286385"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-025-09553-6"}],"event":{"name":"2025 Computing, Communications and IoT Applications (ComComAp)","location":"Madrid, Spain","start":{"date-parts":[[2025,12,14]]},"end":{"date-parts":[[2025,12,17]]}},"container-title":["2025 Computing, Communications and IoT Applications (ComComAp)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11353105\/11353106\/11353146.pdf?arnumber=11353146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T21:00:05Z","timestamp":1769806805000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11353146\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,14]]},"references-count":8,"URL":"https:\/\/doi.org\/10.1109\/comcomap68359.2025.11353146","relation":{},"subject":[],"published":{"date-parts":[[2025,12,14]]}}}