{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:41:57Z","timestamp":1783352517547,"version":"3.54.6"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2022YFA1004102"],"award-info":[{"award-number":["2022YFA1004102"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62250710682"],"award-info":[{"award-number":["62250710682"]}],"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":["62272210"],"award-info":[{"award-number":["62272210"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Intell. Mag."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/mci.2023.3277768","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T20:01:06Z","timestamp":1689796866000},"page":"14-28","source":"Crossref","is-referenced-by-count":42,"title":["How Good is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problem"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4223-2438","authenticated-orcid":false,"given":"Shengcai","family":"Liu","sequence":"first","affiliation":[{"name":"Southern University of Science Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7442-375X","authenticated-orcid":false,"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Southern University of Science Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6236-2002","authenticated-orcid":false,"given":"Ke","family":"Tang","sequence":"additional","affiliation":[{"name":"Southern University of Science Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8837-4442","authenticated-orcid":false,"given":"Xin","family":"Yao","sequence":"additional","affiliation":[{"name":"Southern University of Science Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref57","article-title":"Concorde TSP solver","author":"applegate","year":"2006"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref15","first-page":"5138","article-title":"Matrix encoding networks for neural combinatorial optimization","author":"kwon","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2984546"},{"key":"ref14","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"0","journal-title":"Proc Workshop Track Proc ICLR"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2006910"},{"key":"ref53","article-title":"Learn to design the heuristics for vehicle routing problem","author":"gao","year":"2020"},{"key":"ref52","article-title":"Dynamic partial removal: A neural network heuristic for large neighborhood search","author":"chen","year":"2020"},{"key":"ref11","article-title":"Neural machine translation by jointly learning to align and translate","author":"bahdanau","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref55","article-title":"netgen: Network generator for combinatorial graph problems","author":"bossek","year":"2015"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"ref17","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","author":"nazari","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","article-title":"OR-tools","author":"perron","year":"2019"},{"key":"ref19","first-page":"6281","article-title":"Learning to perform local rewriting for combinatorial optimization","author":"chen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","article-title":"Attention, learn to solve routing problems!","author":"kool","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref51","article-title":"A new local search algorithm providing high quality solutions to vehicle routing problems","volume":"46","author":"shaw","year":"1997","journal-title":"APES Group Dept Comput Sci"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1080\/00207169108804011"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2007.01.002"},{"key":"ref45","article-title":"A learning-based iterative method for solving vehicle routing problems","author":"lu","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref48","first-page":"443","article-title":"Neural large neighborhood search for the capacitated vehicle routing problem","author":"hottung","year":"0","journal-title":"Proc ECAI"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2004.836471"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref41","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref44","first-page":"465","article-title":"Learning 2-opt heuristics for the traveling salesman problem via deep reinforcement learning","author":"costa","year":"0","journal-title":"Proc Asian Conf Mach Learn"},{"key":"ref43","first-page":"7472","article-title":"Neurolkh: Combining deep learning model with lin-kernighan-helsgaun heuristic for solving the traveling salesman problem","author":"xin","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2023449"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_91"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1120.0506"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.06.039"},{"key":"ref4","author":"gutin","year":"2006","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/11499305_5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref40","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","author":"ma","year":"2019"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-5577-0_51"},{"key":"ref34","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2020.3031409"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF00339943"},{"key":"ref30","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"joshi","year":"2019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.15"},{"key":"ref2","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"karp","year":"0","journal-title":"Proc Symp Complexity Comput Comput"},{"key":"ref1","author":"korte","year":"2011","journal-title":"Combinatorial Optimization"},{"key":"ref39","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"khalil","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011560"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: Iterated racing for automatic algorithm configuration","volume":"3","author":"l\u00f3pez-ib\u00e1\u00f1ez","year":"2016","journal-title":"Perspectives on Operations Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_14"},{"key":"ref20","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","author":"kwon","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2590558"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2022.01.018"},{"key":"ref21","first-page":"11096","article-title":"Learning to iteratively solve routing problems with dual-aspect collaborative transformer","author":"ma","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref27","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3059661"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.04.022"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0330"}],"container-title":["IEEE Computational Intelligence Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10207\/10188447\/10188470.pdf?arnumber=10188470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T17:57:19Z","timestamp":1691431039000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10188470\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":63,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/mci.2023.3277768","relation":{},"ISSN":["1556-603X","1556-6048"],"issn-type":[{"value":"1556-603X","type":"print"},{"value":"1556-6048","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}