{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:41:48Z","timestamp":1759840908360,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022ZD0120002"],"award-info":[{"award-number":["2022ZD0120002"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT)","award":["No. RS-2025-00555463"],"award-info":[{"award-number":["No. RS-2025-00555463"]}]},{"name":"Tianjin Top Scientist Studio Project","award":["24JRRCRC00030"],"award-info":[{"award-number":["24JRRCRC00030"]}]},{"name":"Tianjin Belt and Road Joint Laboratory","award":["24PTLYHZ00250"],"award-info":[{"award-number":["24PTLYHZ00250"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,14]]},"DOI":"10.1145\/3712255.3726585","type":"proceedings-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T15:23:44Z","timestamp":1754925824000},"page":"971-974","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Ant Colony Optimization for Route Planning of Multiple Tourists"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5577-8069","authenticated-orcid":false,"given":"Jun","family":"Zheng","sequence":"first","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0277-3077","authenticated-orcid":false,"given":"Qiang","family":"Yang","sequence":"additional","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3861-2488","authenticated-orcid":false,"given":"Dan-Ting","family":"Duan","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6627-2514","authenticated-orcid":false,"given":"Pei-Lan","family":"Xu","sequence":"additional","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9147-2614","authenticated-orcid":false,"given":"Cheng-Zhi","family":"Qu","sequence":"additional","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5066-4716","authenticated-orcid":false,"given":"Zhen-Yu","family":"Lu","sequence":"additional","affiliation":[{"name":"Nanjing University of Information Science and Technology, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-9871","authenticated-orcid":false,"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2025,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3381344"},{"volume-title":"Int. Conf. Mach. Intell. Theory Appl., 1\u20136.","author":"Xu H. R.","key":"e_1_3_2_1_2_1","unstructured":"H. R. Xu, J. Y. Li, and Z. H. Zhan, 2024. A Novel Evolutionary Algorithm for Multiple Traveling Salesman Problem Containing Targets with Multiple Visits. In Int. Conf. Mach. Intell. Theory Appl., 1\u20136."},{"key":"e_1_3_2_1_3_1","volume-title":"Ant Colony Optimization for Multiple Traveling Salesmen Problem with Revisitable Cities. In Int. Conf. Mach. Intell. Theory Appl., 1\u20136.","author":"Sun B.","year":"2024","unstructured":"B. Sun et al., 2024. Ant Colony Optimization for Multiple Traveling Salesmen Problem with Revisitable Cities. In Int. Conf. Mach. Intell. Theory Appl., 1\u20136."},{"key":"e_1_3_2_1_4_1","first-page":"145","article-title":"A Benchmark Test Suite for Multiple Traveling Salesmen Problem with Pivot Cities. In Web","author":"Bo Z. Y.","year":"2025","unstructured":"Z. Y. Bo, D. T. Duan, Q. Yang, et al., 2025. A Benchmark Test Suite for Multiple Traveling Salesmen Problem with Pivot Cities. In Web Inf. Syst. Eng. Springer Nature Singapore, Singapore, 145\u2013157.","journal-title":"Inf. Syst. Eng. Springer Nature Singapore, Singapore"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101450"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3277501"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40747-023-00993-w"},{"volume-title":"Design of Path Planning Algorithm for Tourist Attractions Based on Deep Learning. In Int. Conf. 3D Immersion Interact. Multisens. Exp., 297\u2013301","author":"Tong W.","key":"e_1_3_2_1_8_1","unstructured":"W. Tong and Y C. Ruan, 2023. Design of Path Planning Algorithm for Tourist Attractions Based on Deep Learning. In Int. Conf. 3D Immersion Interact. Multisens. Exp., 297\u2013301."},{"key":"e_1_3_2_1_9_1","volume-title":"Diversity-Oriented Route Planning for Tourists. In Int. Conf. Database Expert Syst. Appl., 243\u2013255","author":"Kong W. K.","year":"2022","unstructured":"W. K. Kong, S. Y. Zheng, M. L. Nguyen, et al., 2022. Diversity-Oriented Route Planning for Tourists. In Int. Conf. Database Expert Syst. Appl., 243\u2013255."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40558-017-0080-9"},{"key":"e_1_3_2_1_11_1","volume-title":"Hybrid Genetic Algorithm and Ant Colony Algorithm for Solving Travelling Salesman Problem. In IEEE Int. Conf. Comput. Intell. Appl., 69\u201373","author":"Thongpiem J.","year":"2024","unstructured":"J. Thongpiem, N. Punkong, C. Ratanavilisagul, et al., 2024. Hybrid Genetic Algorithm and Ant Colony Algorithm for Solving Travelling Salesman Problem. In IEEE Int. Conf. Comput. Intell. Appl., 69\u201373."},{"key":"e_1_3_2_1_12_1","volume-title":"Adaptive Ant Selection for Pheromone Update in Ant Colony Optimization. In IEEE Int. Conf. Syst. Man Cybern., 667\u2013672","author":"Wang B.","year":"2024","unstructured":"B. Wang et al., 2024. Adaptive Ant Selection for Pheromone Update in Ant Colony Optimization. In IEEE Int. Conf. Syst. Man Cybern., 667\u2013672."},{"volume-title":"An Ant Colony System Algorithm for Multiple Traveling Salesman Problem with Hub Cities. In Int. Conf. Mach. Intell. Theory Appl., 1\u20137.","author":"Chen Y. X.","key":"e_1_3_2_1_13_1","unstructured":"Y. X. Chen and F. Y. Tang, 2024. An Ant Colony System Algorithm for Multiple Traveling Salesman Problem with Hub Cities. In Int. Conf. Mach. Intell. Theory Appl., 1\u20137."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3520304.3528911"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107293"},{"key":"e_1_3_2_1_17_1","first-page":"31","article-title":"A New Rank Based Vesion of the Ant System: A Computational Study. In","author":"Bullnheimer B.","year":"1997","unstructured":"B. Bullnheimer, R. F. Hartl, and C. Strauss, 1997. A New Rank Based Vesion of the Ant System: A Computational Study. In Cent. Eur. J. Oper. Res., 31\u201340.","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/348599.348603"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"}],"event":{"name":"GECCO '25 Companion: Genetic and Evolutionary Computation Conference Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"NH Malaga Hotel Malaga Spain","acronym":"GECCO '25 Companion"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3712255.3726585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:06:26Z","timestamp":1759838786000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3712255.3726585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,14]]},"references-count":19,"alternative-id":["10.1145\/3712255.3726585","10.1145\/3712255"],"URL":"https:\/\/doi.org\/10.1145\/3712255.3726585","relation":{},"subject":[],"published":{"date-parts":[[2025,7,14]]},"assertion":[{"value":"2025-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}