{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:25:25Z","timestamp":1784906725260,"version":"3.55.0"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11991023"],"award-info":[{"award-number":["11991023"]}],"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":["62076197"],"award-info":[{"award-number":["62076197"]}],"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":["62106096"],"award-info":[{"award-number":["62106096"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Provincial Key Laboratory","award":["2020B121201001"],"award-info":[{"award-number":["2020B121201001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tetci.2021.3139802","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T20:50:21Z","timestamp":1643057421000},"page":"1010-1024","source":"Crossref","is-referenced-by-count":27,"title":["RL-CSL: A Combinatorial Optimization Method Using Reinforcement Learning and Contrastive Self-Supervised Learning"],"prefix":"10.1109","volume":"7","author":[{"given":"Zhongju","family":"Yuan","sequence":"first","affiliation":[{"name":"School of System Design and Intelligent Manufacturing, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9950-9848","authenticated-orcid":false,"given":"Genghui","family":"Li","sequence":"additional","affiliation":[{"name":"School of System Design and Intelligent Manufacturing, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1152-6780","authenticated-orcid":false,"given":"Zhenkun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of System Design and Intelligent Manufacturing and also with the Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9188-1856","authenticated-orcid":false,"given":"Jianyong","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, Shaanxi Province, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9410-8263","authenticated-orcid":false,"given":"Ran","family":"Cheng","sequence":"additional","affiliation":[{"name":"Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2932996"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.02.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref8","first-page":"1","article-title":"Attention, learn to solve routing problems","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kool","year":"2018"},{"key":"ref9","first-page":"1","article-title":"A learning-based iterative method for solving vehicle routing problems","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lu","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00453-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-08011-1_14"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"ref14","first-page":"2692","article-title":"Pointer networks","volume":"28","author":"Vinyals","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref15","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":"STAT"},{"key":"ref16","article-title":"An extension of the lin-kernighan-helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","author":"Helsgaun","year":"2017"},{"key":"ref17","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","volume":"31","author":"Nazari","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref18","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.202"},{"issue":"2","key":"ref20","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","author":"Weinberger","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"ref22","first-page":"1857","article-title":"Improved deep metric learning with multi-class N-pair loss objective","volume-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst.","author":"Sohn","year":"2016"},{"key":"ref23","first-page":"297","article-title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist. JMLR Workshop Conf. Proc.","author":"Gutmann","year":"2010"},{"key":"ref24","article-title":"Representation learning with contrastive predictive coding","author":"Oord","year":"2018"},{"key":"ref25","article-title":"A survey on deep learning-based methodologies for solving combinatorial optimization problems","author":"Thapa","year":"2020"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.79.8.2554"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00363956"},{"key":"ref28","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sutskever","year":"2014"},{"key":"ref29","first-page":"268","article-title":"Learning a latent search space for routing problems using variational autoencoders","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hottung","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1039\/C9SC01928F"},{"key":"ref31","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Dai","year":"2017"},{"key":"ref32","article-title":"Learn to design the heuristics for vehicle routing problem","author":"Gao","year":"2020"},{"key":"ref33","first-page":"6281","article-title":"Learning to perform local rewriting for combinatorial optimization","volume":"32","author":"Chen","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref34","article-title":"Efficient active search for combinatorial optimization problems","author":"Hottung","year":"2021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403356"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA51294.2020.00013"},{"key":"ref37","first-page":"21188","article-title":"POMO: Policy optimization with multiple optima for reinforcement learning","volume":"33","author":"Kwon","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107252"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3068828"},{"key":"ref41","article-title":"Solving a new 3D bin packing problem with deep reinforcement learning method","author":"Hu","year":"2017"},{"key":"ref42","article-title":"Ranked reward: Enabling self-play reinforcement learning for combinatorial optimization","author":"Laterre","year":"2018"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-020-0177-2"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2018.12.003"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2020.3031409"},{"key":"ref46","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vaswani","year":"2017"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref48","first-page":"21","article-title":"Layer normalization","volume-title":"STAT","volume":"1050","author":"Ba","year":"2016"},{"key":"ref49","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2018"},{"key":"ref50","first-page":"2488","article-title":"How does batch normalization help optimization?","volume-title":"Proc. 32nd Int. Conf. Neural Inf. Process. Syst.","author":"Santurkar","year":"2018"},{"key":"ref51","article-title":"Supervised contrastive learning","volume":"33","author":"Khosla","year":"2020","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref52","first-page":"9458","article-title":"Few-shot domain adaptation by causal mechanism transfer","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Teshima"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.427"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.552"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref56","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref58","article-title":"Gurobi","year":"2020"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/10190085\/09690950.pdf?arnumber=9690950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:33:04Z","timestamp":1705026784000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9690950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":59,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2021.3139802","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}