{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:24:56Z","timestamp":1775143496596,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Research Foundation, Singapore, under its AI Singapore Programme","award":["AISG3-RP-2022-031"],"award-info":[{"award-number":["AISG3-RP-2022-031"]}]},{"name":"Guangdong Natural Science Funds for Distinguished Young Scholars","award":["2022B1515020049"],"award-info":[{"award-number":["2022B1515020049"]}]},{"name":"Guangdong Provincial Natural Science Foundation for Outstanding Youth Team Project","award":["2024B1515040010"],"award-info":[{"award-number":["2024B1515040010"]}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276100"],"award-info":[{"award-number":["62276100"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709181","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:44:43Z","timestamp":1743792283000},"page":"683-694","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Diversity Optimization for Travelling Salesman Problem via Deep Reinforcement Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0873-7046","authenticated-orcid":false,"given":"Qi","family":"Li","sequence":"first","affiliation":[{"name":"South China University of Technology, GuangZhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4499-759X","authenticated-orcid":false,"given":"Zhiguang","family":"Cao","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6639-8547","authenticated-orcid":false,"given":"Yining","family":"Ma","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-6599","authenticated-orcid":false,"given":"Yaoxin","family":"Wu","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, Eindhoven, Noord-Brabant, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5648-1160","authenticated-orcid":false,"given":"Yue-Jiao","family":"Gong","sequence":"additional","affiliation":[{"name":"South China University of Technology, Guangzhou, Guangdong, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599425"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/E-SCIENCE.2006.261199"},{"key":"e_1_3_2_2_3_1","unstructured":"P. Augerat. 1995. Set A. http:\/\/vrp.atd-lab.inf.puc-rio.br\/index.php\/en\/."},{"key":"e_1_3_2_2_4_1","volume-title":"Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473","author":"Bahdanau Dzmitry","year":"2014","unstructured":"Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473 (2014)."},{"key":"e_1_3_2_2_5_1","volume-title":"International Conference on Learning Representations. arXiv preprint arXiv:1611","author":"Bello Irwan","year":"2017","unstructured":"Irwan Bello, Hieu Pham, Quoc V Le, Mohammad Norouzi, and Samy Bengio. 2017. Neural combinatorial optimization with reinforcement learning, In International Conference on Learning Representations. arXiv preprint arXiv:1611.09940."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_2_7_1","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Choo Jinho","year":"2022","unstructured":"Jinho Choo, Yeong-Dae Kwon, Jihoon Kim, Jeongwoo Jae, Andr\u00e9 Hottung, Kevin Tierney, and Youngjune Gwon. 2022. Simulation-guided Beam Search for Neural Combinatorial Optimization. In Advances in Neural Information Processing Systems, Vol. 35. Curran Associates, Inc., 8760--8772."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939862"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528724"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403355"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005601"},{"key":"e_1_3_2_2_12_1","volume-title":"Population-Based Reinforcement Learning for Combinatorial Optimization. arXiv preprint arXiv:2210.03475","author":"Grinsztajn Nathan","year":"2022","unstructured":"Nathan Grinsztajn, Daniel Furelos-Blanco, and Thomas D Barrett. 2022. Population-Based Reinforcement Learning for Combinatorial Optimization. arXiv preprint arXiv:2210.03475 (2022)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205651.3205731"},{"key":"e_1_3_2_2_14_1","volume-title":"Efficient Active Search for Combinatorial Optimization Problems. In International Conference on Learning Representations.","author":"Hottung Andr\u00e9","year":"2022","unstructured":"Andr\u00e9 Hottung, Yeong-Dae Kwon, and Kevin Tierney. 2022. Efficient Active Search for Combinatorial Optimization Problems. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_15_1","first-page":"508","article-title":"A niching memetic algorithm for multi-solution traveling salesman problem","volume":"24","author":"Huang Ting","year":"2019","unstructured":"Ting Huang, Yue-Jiao Gong, Sam Kwong, Hua Wang, and Jun Zhang. 2019. A niching memetic algorithm for multi-solution traveling salesman problem. IEEE Transactions on Evolutionary Computation, Vol. 24, 3 (2019), 508--522.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2018.8628856"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539296"},{"key":"e_1_3_2_2_18_1","volume-title":"An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227","author":"Joshi Chaitanya K","year":"2019","unstructured":"Chaitanya K Joshi, Thomas Laurent, and Xavier Bresson. 2019. An efficient graph convolutional network technique for the travelling salesman problem. arXiv preprint arXiv:1906.01227 (2019)."},{"key":"e_1_3_2_2_19_1","first-page":"10418","article-title":"Learning collaborative policies to solve NP-hard routing problems","volume":"34","author":"Kim Minsu","year":"2021","unstructured":"Minsu Kim, Jinkyoo Park, et al. 2021. Learning collaborative policies to solve NP-hard routing problems. In Advances in Neural Information Processing Systems, Vol. 34. 10418--10430.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_20_1","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Kim Minsu","year":"2022","unstructured":"Minsu Kim, Junyoung Park, and Jinkyoo Park. 2022. Sym-NCO: Leveraging Symmetricity for Neural Combinatorial Optimization. In Advances in Neural Information Processing Systems, Vol. 35. Curran Associates, Inc., 1936--1949."},{"key":"e_1_3_2_2_21_1","volume-title":"Advances in Neural Information Processing Systems","author":"Konda Vijay","unstructured":"Vijay Konda and John Tsitsiklis. 1999. Actor-Critic Algorithms. In Advances in Neural Information Processing Systems, Vol. 12. MIT Press."},{"key":"e_1_3_2_2_22_1","volume-title":"International Conference on Learning Representations.","author":"Kool Wouter","year":"2019","unstructured":"Wouter Kool, Herke van Hoof, and Max Welling. 2019. Attention, Learn to Solve Routing Problems!. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_23_1","first-page":"21188","article-title":"Pomo: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon Yeong-Dae","year":"2020","unstructured":"Yeong-Dae Kwon, Jinho Choo, Byoungjip Kim, Iljoo Yoon, Youngjune Gwon, and Seungjai Min. 2020. Pomo: Policy optimization with multiple optima for reinforcement learning. Advances in Neural Information Processing Systems, Vol. 33 (2020), 21188--21198.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_24_1","volume-title":"Benchmark functions for CEC'2013 special session and competition on niching methods for multimodal function optimization","author":"Li Xiaodong","year":"2013","unstructured":"Xiaodong Li, Andries Engelbrecht, and Michael G Epitropakis. 2013. Benchmark functions for CEC'2013 special session and competition on niching methods for multimodal function optimization. RMIT University, Evolutionary Computation and Machine Learning Group, Australia, Tech. Rep (2013)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SMC52423.2021.9658818"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3239546"},{"key":"e_1_3_2_2_27_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Luo Fu","year":"2023","unstructured":"Fu Luo, Xi Lin, Fei Liu, Qingfu Zhang, and Zhenkun Wang. 2023. Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalization. In Advances in Neural Information Processing Systems, Vol. 36. Curran Associates, Inc., 8845--8864."},{"key":"e_1_3_2_2_28_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Ma Yining","year":"2023","unstructured":"Yining Ma, Zhiguang Cao, and Yeow Meng Chee. 2023. Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt. In Advances in Neural Information Processing Systems, Vol. 36. Curran Associates, Inc., 49555--49578."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"e_1_3_2_2_30_1","unstructured":"Laurent Perron and Vincent Furnon. [n. d.]. OR-Tools. Google. https:\/\/developers.google.com\/optimization\/"},{"key":"e_1_3_2_2_31_1","volume-title":"TSPLIB-A traveling salesman problem library. ORSA journal on computing","author":"Reinelt Gerhard","year":"1991","unstructured":"Gerhard Reinelt. 1991. TSPLIB-A traveling salesman problem library. ORSA journal on computing, Vol. 3, 4 (1991), 376--384."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1995.487459"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3127077"},{"key":"e_1_3_2_2_34_1","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141 ukasz Kaiser, and Illia Polosukhin. 2017. Attention is All you Need. In Advances in Neural Information Processing Systems, Vol. 30. Curran Associates, Inc."},{"key":"e_1_3_2_2_35_1","volume-title":"Advances in Neural Information Processing Systems","volume":"28","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer Networks. In Advances in Neural Information Processing Systems, Vol. 28. Curran Associates, Inc."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2020.3031409"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17430"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220111"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346996"},{"key":"e_1_3_2_2_40_1","volume-title":"Proceedings of the 20th international conference on machine learning (ICML-03)","author":"Yu Lei","year":"2003","unstructured":"Lei Yu and Huan Liu. 2003. Feature selection for high-dimensional data: A fast correlation-based filter solution. In Proceedings of the 20th international conference on machine learning (ICML-03). 856--863."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1049\/cim2.12072"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3207011"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3249799"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539037"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:47:45Z","timestamp":1755359265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":44,"alternative-id":["10.1145\/3690624.3709181","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709181","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}