{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:09:12Z","timestamp":1774595352271,"version":"3.50.1"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"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":["72071205"],"award-info":[{"award-number":["72071205"]}],"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":["61873328"],"award-info":[{"award-number":["61873328"]}],"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":["61773390"],"award-info":[{"award-number":["61773390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tcyb.2021.3103811","type":"journal-article","created":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T20:30:33Z","timestamp":1630009833000},"page":"13142-13155","source":"Crossref","is-referenced-by-count":86,"title":["Deep Reinforcement Learning for Combinatorial Optimization: Covering Salesman Problems"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1550-5987","authenticated-orcid":false,"given":"Kaiwen","family":"Li","sequence":"first","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0432-2942","authenticated-orcid":false,"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9048-2979","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, Changsha, China"}]},{"given":"Yuheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Graduate College, National University of Defense Technology, Changsha, China"}]},{"given":"Yi","family":"Han","sequence":"additional","affiliation":[{"name":"Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8964-6454","authenticated-orcid":false,"given":"Ling","family":"Wang","sequence":"additional","affiliation":[{"name":"Department of Automation, Tsinghua University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2849403"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2728120"},{"key":"ref33","first-page":"539","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","author":"li","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","author":"joshi","year":"2019","journal-title":"An efficient graph convolutional network technique for the travelling salesman problem"},{"key":"ref31","first-page":"22","article-title":"A note on learning algorithms for quadratic assignment with graph neural networks","volume":"1050","author":"nowak","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn (ICML)"},{"key":"ref30","author":"mittal","year":"2019","journal-title":"Learning Heuristics over Large Graphs via Deep Reinforcement Learning"},{"key":"ref37","author":"ma","year":"2019","journal-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref34","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"khalil","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref29","author":"mnih","year":"2013","journal-title":"Playing atari with deep reinforcement learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.12.026"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.3.208"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.03.001"},{"key":"ref22","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume":"27","author":"sutskever","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00339943"},{"key":"ref24","author":"bello","year":"2016","journal-title":"Neural Combinatorial Optimization with Reinforcement Learning"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref26","author":"nazari","year":"2018","journal-title":"Reinforcement learning for solving the vehicle routing problem"},{"key":"ref25","first-page":"1008","article-title":"Actor–critic algorithms","author":"konda","year":"2000","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref50","author":"kingma","year":"2014","journal-title":"Adam A method for stochastic optimization"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref11","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2869674"},{"key":"ref12","author":"kool","year":"2018","journal-title":"Attention learn to solve routing problems!"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0480"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.01.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.08.057"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0761-4_28"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.02.019"},{"key":"ref18","first-page":"245","article-title":"A metameric genetic algorithm with new operator for covering salesman problem with full coverage","volume":"10","author":"tripathy","year":"2017","journal-title":"J Control Theory Applied"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-020-04898-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004964"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.10.024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.14.4.699"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2962865"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2931434"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00992696","article-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","volume":"8","author":"williams","year":"1998","journal-title":"Mach Learn"},{"key":"ref9","article-title":"A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem","author":"jia","year":"2021","journal-title":"IEEE Trans Cybern"},{"key":"ref46","author":"mazyavkina","year":"2020","journal-title":"Reinforcement Learning for Combinatorial Optimization A Survey"},{"key":"ref45","author":"sato","year":"2019","journal-title":"Approximation ratios of graph neural networks for combinatorial problems"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref42","article-title":"Solving NP-hard problems on graphs by reinforcement learning without domain knowledge","author":"abe","year":"0","journal-title":"Simulation"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"key":"ref44","author":"joshi","year":"2019","journal-title":"On learning paradigms for the travelling salesman problem"},{"key":"ref43","first-page":"7992","article-title":"Learning local search heuristics for Boolean satisfiability","author":"yolcu","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9954939\/09523517.pdf?arnumber=9523517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:14:18Z","timestamp":1670872458000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9523517\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":51,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2021.3103811","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}