{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:21:32Z","timestamp":1783610492765,"version":"3.55.0"},"reference-count":64,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008111","name":"Jilin Provincial Department of Science and Technology Project","doi-asserted-by":"publisher","award":["20230201083GX"],"award-info":[{"award-number":["20230201083GX"]}],"id":[{"id":"10.13039\/501100008111","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008111","name":"Jilin Provincial Department of Science and Technology Project","doi-asserted-by":"publisher","award":["20240101369JC"],"award-info":[{"award-number":["20240101369JC"]}],"id":[{"id":"10.13039\/501100008111","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008111","name":"Jilin Provincial Department of Science and Technology Project","doi-asserted-by":"publisher","award":["20240302086GX"],"award-info":[{"award-number":["20240302086GX"]}],"id":[{"id":"10.13039\/501100008111","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Nanyang Associate Professorship"},{"DOI":"10.13039\/501100001321","name":"National Research Foundation Fellowship, Singapore","doi-asserted-by":"publisher","award":["NRF-NRFF13-2021-0006"],"award-info":[{"award-number":["NRF-NRFF13-2021-0006"]}],"id":[{"id":"10.13039\/501100001321","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tnnls.2024.3483231","type":"journal-article","created":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:32:54Z","timestamp":1730208774000},"page":"13402-13416","source":"Crossref","is-referenced-by-count":15,"title":["Reinforcement Learning-Based Nonautoregressive Solver for Traveling Salesman Problems"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6441-9167","authenticated-orcid":false,"given":"Yubin","family":"Xiao","sequence":"first","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Wang","sequence":"additional","affiliation":[{"name":"Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, Nanyang Technological University, Nanyang Avenue, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6230-2376","authenticated-orcid":false,"given":"Boyang","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University, Nanyang Avenue, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3918-384X","authenticated-orcid":false,"given":"Huanhuan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1761-6659","authenticated-orcid":false,"given":"Wei","family":"Pang","sequence":"additional","affiliation":[{"name":"School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuan","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4809-0514","authenticated-orcid":false,"given":"Dong","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, Bond Life Sciences Center, University of Missouri, Columbia, MO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1147-3968","authenticated-orcid":false,"given":"Yanchun","family":"Liang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Zhuhai College of Science and Technology, Zhuhai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0013-1281","authenticated-orcid":false,"given":"You","family":"Zhou","sequence":"additional","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education, College of Computer Science and Technology, Jilin University, Changchun, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Computers and Intractability: A Guide To the Theory of NP-Completeness","author":"Garey","year":"1990"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0036"},{"key":"ref3","first-page":"642","article-title":"Algorithms for facility location problems with outliers","volume-title":"Proc. Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Charikar"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3159713"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3148435"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105937"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105905"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3236629"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2024.3352096"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3159671"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref12","article-title":"Neural combinatorial optimization algorithms for solving vehicle routing problems: A comprehensive survey with perspectives","author":"Wu","year":"2024","journal-title":"arXiv:2406.00415"},{"key":"ref13","first-page":"1","article-title":"Divide and conquer networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Nowak"},{"key":"ref14","first-page":"1","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","volume-title":"Proc. INFORMS Annu. Meeting, Session Boosting Combinat. Optim. Mach. Learn.","author":"Joshi"},{"key":"ref15","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2007"},{"key":"ref16","first-page":"1","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kool"},{"key":"ref17","article-title":"The transformer network for the traveling salesman problem","author":"Bresson","year":"2021","journal-title":"arXiv:2103.03012"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-024-05603-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.02.014"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.131"},{"key":"ref21","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals"},{"key":"ref22","first-page":"1","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent. Workshop","author":"Bello"},{"key":"ref23","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Khalil"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-021-00779-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127392"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111559"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-022-09327-y"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30008"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0440-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/261342.571216"},{"key":"ref34","article-title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","author":"Helsgaun","year":"2017"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-08011-1_14"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.08.115"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3001590"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.079"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2678482"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.02.041"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.116814"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3091695"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2023.3346969"},{"issue":"11","key":"ref45","first-page":"2521","article-title":"Research reviews of combinatorial optimization methods based on deep reinforcement learning","volume":"47","author":"Kai-Wen","year":"2021","journal-title":"Acta Automatica Sinica"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3249799"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3285077"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2024.3371781"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3314375"},{"key":"ref50","first-page":"7472","article-title":"NeuroLKH: Combining deep learning model with Lin-Kernighan-Helsgaun heuristic for solving the traveling salesman problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Xin"},{"key":"ref51","first-page":"43706","article-title":"DeepACO: Neural-enhanced ant systems for combinatorial optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Ye"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref54","article-title":"Improving generalization of neural vehicle routing problem solvers through the lens of model architecture","author":"Xiao","year":"2024","journal-title":"arXiv:2406.06652"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i15.17618"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-3204"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-020-03906-7"},{"key":"ref58","first-page":"49555","article-title":"Learning to search feasible and infeasible regions of routing problems with flexible neural k-opt","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"36","author":"Ma"},{"key":"ref59","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86362-3_21"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref63","first-page":"1","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","volume-title":"Proc. AAAI Workshop Deep Learn. Graphs: Methodol. Appl.","author":"Ma"},{"key":"ref64","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kwon"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11073756\/10737904.pdf?arnumber=10737904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:20:00Z","timestamp":1752103200000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10737904\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":64,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2024.3483231","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}