{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:17:41Z","timestamp":1759331861192,"version":"3.28.0"},"reference-count":46,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T00:00:00Z","timestamp":1719705600000},"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":["62136008,62276001,U21A20512"],"award-info":[{"award-number":["62136008,62276001,U21A20512"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Anhui Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2308085J03,2208085MF174"],"award-info":[{"award-number":["2308085J03,2208085MF174"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,6,30]]},"DOI":"10.1109\/cec60901.2024.10611814","type":"proceedings-article","created":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T17:55:15Z","timestamp":1723139715000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["A Deep Reinforcement Learning Assisted Heuristic for Solving Traveling Salesman Problems"],"prefix":"10.1109","author":[{"given":"Ye","family":"Tian","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Anhui University,Hefei,China"}]},{"given":"Qinghui","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University,Hefei,China"}]},{"given":"Shuai","family":"Shao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University,Hefei,China"}]},{"given":"Langchun","family":"Si","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University,Hefei,China"}]},{"given":"Xingyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institutes of Physical Science and Information, Anhui University,Hefei,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/3010604"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTON.2014.6876285"},{"volume-title":"Combinatorial optimization: algorithms and complexity","year":"1998","author":"Papadimitriou","key":"ref3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref5","volume-title":"Dynamic programming and optimal control:","volume":"I","author":"Bertsekas","year":"2012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1201\/EBK0824740993"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/261342.571216"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00330-002-1803-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897580"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.02.017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2962137"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.016"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2022.3186546"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3098186"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105875"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1004369"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"article-title":"Pointer networks","volume-title":"Proceedings of the International Conference on Neural Information Processing Systems","author":"Vinyals","key":"ref21"},{"key":"ref22","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"arXiv preprint"},{"key":"ref23","article-title":"Reinforcement learning for solving the vehicle routing problem","volume":"31","author":"Nazari","year":"2018","journal-title":"Advances in Neural Information Proceseing Systems"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref25","article-title":"Combinatorial optimization by graph pointer networks and hierarchical rein-forcement learning","author":"Ma","year":"2019","journal-title":"arXiv preprint"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"article-title":"Attention, learn to solve routing problems!","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Kool","key":"ref27"},{"key":"ref28","article-title":"Learning to perform local rewriting for combinatorial optimization","volume":"32","author":"Chen","year":"2019","journal-title":"Advances in Neural Information Precessing Systems"},{"key":"ref29","article-title":"Learning local search heuristics for boolean satisfiability","volume":"32","author":"Yolcu","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5_11"},{"key":"ref32","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref33","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref34","article-title":"Learning heuristics over large graphs via deep rein-forcement learning","author":"Manchanda","year":"2019","journal-title":"arXiv preprint"},{"key":"ref35","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume":"31","author":"Li","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref36","article-title":"A note on learning algorithms for quadratic assignment with graph neural networks","author":"Nowak","year":"2017","journal-title":"arXiv preprint"},{"key":"ref37","article-title":"An efficient graph convo-lutional network technique for the travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv preprint"},{"key":"ref38","article-title":"Unsupervised learning for solving the travelling salesman problem","author":"Min","year":"2023","journal-title":"ar Xiv preprint"},{"article-title":"Graph neu-ral network guided local search for the traveling salesperson problem","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Hudson","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.4.387"},{"key":"ref41","first-page":"59","article-title":"Nonstationary function optimization using genetic algorithms with dominance and diploidy","volume-title":"Proceedings of the Second International Conference on Genetic Algorithms","author":"Goldberg"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref43","article-title":"Actor-critic- algorithms","volume":"12","author":"Konda","year":"1999","journal-title":"Advances in Neural Information Processing Systems"},{"volume-title":"Concorde TSP solver","year":"2006","author":"Applegate","key":"ref44"},{"key":"ref45","article-title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","author":"Helsgaun","year":"2017","journal-title":"Roskilde University, Roskilde, Denmark, Tech. Rep."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"}],"event":{"name":"2024 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2024,6,30]]},"location":"Yokohama, Japan","end":{"date-parts":[[2024,7,5]]}},"container-title":["2024 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10609966\/10611750\/10611814.pdf?arnumber=10611814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:08:59Z","timestamp":1723349339000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10611814\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,30]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/cec60901.2024.10611814","relation":{},"subject":[],"published":{"date-parts":[[2024,6,30]]}}}