{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:14:51Z","timestamp":1775229291884,"version":"3.50.1"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372376"],"award-info":[{"award-number":["62372376"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62102431"],"award-info":[{"award-number":["62102431"]}],"id":[{"id":"10.13039\/501100001809","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,11]]},"DOI":"10.1109\/tnnls.2025.3591311","type":"journal-article","created":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:31:06Z","timestamp":1753813866000},"page":"19604-19618","source":"Crossref","is-referenced-by-count":22,"title":["Solving Scalable Multiagent Routing Problems With Reinforcement Learning"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2271-1810","authenticated-orcid":false,"given":"Yujiao","family":"Hu","sequence":"first","affiliation":[{"name":"School of Data Science and Artificial Intelligence, Chang’an University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6509-9297","authenticated-orcid":false,"given":"Yuan","family":"Yao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Northwestern Polytechnical University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6234-1001","authenticated-orcid":false,"given":"Jinchao","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science, Northwestern Polytechnical University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9401-6350","authenticated-orcid":false,"given":"Zhihao","family":"Wang","sequence":"additional","affiliation":[{"name":"Future Network Research Center, Purple Mountain Laboratories, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9902-7910","authenticated-orcid":false,"given":"Qingmin","family":"Jia","sequence":"additional","affiliation":[{"name":"Future Network Research Center, Purple Mountain Laboratories, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8527-6134","authenticated-orcid":false,"given":"Yan","family":"Pan","sequence":"additional","affiliation":[{"name":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"ref2","volume":"1","author":"Korte","year":"2011","journal-title":"Combinatorial Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2607(89)90085-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2004.11.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3699722"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00099-X"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.01.002"},{"key":"ref11","first-page":"20","article-title":"Simulated annealing","author":"Dowsland","year":"1993","journal-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91086-4_1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1203-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106455"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106244"},{"key":"ref16","first-page":"878","article-title":"Learn to solve the min-max multiple traveling salesmen problem with reinforcement learning","volume-title":"Proc. 2023 Int. Conf. Auto. Agents Multiagent Syst.","author":"Park"},{"key":"ref17","article-title":"Learning to cross exchange to solve min-max vehicle routing problems","volume-title":"Proc. The 11th Int. Conf. Learn. Represent.","author":"Kim"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3236629"},{"key":"ref20","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals"},{"key":"ref21","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"arXiv:1611.09940"},{"key":"ref22","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dai"},{"key":"ref23","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018","journal-title":"arXiv:1803.08475"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104061"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.08.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105905"},{"key":"ref28","article-title":"Learning the multiple traveling salesmen problem with permutation invariant pooling networks","author":"Kaempfer","year":"2018","journal-title":"arXiv:1803.09621"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2015.127"},{"issue":"2","key":"ref30","first-page":"699","article-title":"Solving multiple traveling salesman problem using the gravitational emulation local search algorithm","volume":"9","author":"Rostami","year":"2015","journal-title":"Appl. Math. Inf. Sci."},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/21642583.2019.1674220"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"ref33","first-page":"8128","article-title":"A structured prediction approach for generalization in cooperative multi-agent reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Carion"},{"key":"ref34","article-title":"Short combinatorial proof that the DFJ polytope is contained in the MTZ polytope for the asymmetric traveling salesman problem","author":"Velednitsky","year":"2018","journal-title":"arXiv:1805.06997"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.07.038"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3334976"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/11220834\/11099060.pdf?arnumber=11099060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T18:03:17Z","timestamp":1761847397000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11099060\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":37,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2025.3591311","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}