{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:57:52Z","timestamp":1785787072577,"version":"3.56.0"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"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":"crossref","award":["T2341003"],"award-info":[{"award-number":["T2341003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Tianyuan Fund for Mathematics of the National Natural Science Foundation of China","award":["12426105"],"award-info":[{"award-number":["12426105"]}]},{"name":"Fellowship of China National Postdoctoral Program for Innovative Talents","award":["BX20240284"],"award-info":[{"award-number":["BX20240284"]}]},{"name":"Fellowship from the China Postdoctoral Science Foundation","award":["2025M771731"],"award-info":[{"award-number":["2025M771731"]}]},{"name":"Key Research and Development Project of Shaanxi Province","award":["2022GXLH01-15"],"award-info":[{"award-number":["2022GXLH01-15"]}]},{"name":"Sichuan Science and Technology Program","award":["2022NSFSC1907"],"award-info":[{"award-number":["2022NSFSC1907"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tevc.2025.3589640","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T17:39:11Z","timestamp":1752687551000},"page":"1564-1578","source":"Crossref","is-referenced-by-count":0,"title":["Neuro-PLS: A Generalizable Local Search Framework for Multiobjective Combinatorial Optimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7395-1147","authenticated-orcid":false,"given":"Haotian","family":"Zhang","sequence":"first","affiliation":[{"name":"Frontier Institute of Science and Technology, Xi\u2019an Jiaotong University","place":["Xi\u2019an, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4965-916X","authenticated-orcid":false,"given":"Jialong","family":"Shi","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University","place":["Xi\u2019an, 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":"Xi\u2019an Jiaotong University","place":["Xi\u2019an, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0786-0671","authenticated-orcid":false,"given":"Qingfu","family":"Zhang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong","place":["Hong Kong, China"],"department":["Department of Computer Science"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4066-2338","authenticated-orcid":false,"given":"Zongben","family":"Xu","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University","place":["Xi\u2019an, China"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1028989917"},{"issue":"3","key":"ref2","first-page":"282","article-title":"An implicit enumeration algorithm for quadratic integer programming salesman and vehicle routing problems","volume":"26","author":"McBride","year":"1980","journal-title":"Inst. Oper. Res. Manag. Sci."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2013.11.008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.09.122"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17144-4_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0230-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-017-2415-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2880256"},{"key":"ref11","first-page":"3981","article-title":"Learning to learn by gradient descent by gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Andrychowicz"},{"key":"ref12","first-page":"9","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Bello"},{"key":"ref13","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Dai"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3012785"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"key":"ref16","first-page":"12","article-title":"Pareto set learning for neural multi-objective combinatorial optimization","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Lin"},{"key":"ref17","first-page":"6","article-title":"A learning based iterative method for solving vehicle routing problems","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Lu"},{"key":"ref18","first-page":"5","article-title":"Graph neural network guided local search for the Traveling salesperson probelm","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Hudson"},{"key":"ref19","volume-title":"Partial constraint satisfaction problems and guided local search","author":"Voudouris","year":"1996"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0197"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3313688"},{"key":"ref22","first-page":"9","article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Kool"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2021.3139802"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0164"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref26","first-page":"11096","article-title":"Learning to iteratively solve routing problems with dual-aspect collaborative transformer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Ma"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2264"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CEC60901.2024.10611872"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68759-9_6"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.10.062"},{"key":"ref33","first-page":"6","article-title":"Learning to optimize","volume-title":"Proc. Int. Conf. Learn. Rep.","author":"Li"},{"key":"ref34","first-page":"748","article-title":"Learning to learn without gradient descent by gradient descent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3210927"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2022.3222057"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3221483"},{"key":"ref38","volume-title":"Mind your solver! On adversarial attack and defense for combinatorial optimization","author":"Lu","year":"2022"},{"key":"ref39","first-page":"537","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref40","article-title":"An efficient graph convolutional network technique for the Travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv.1906.01227"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3089179"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26419-1_22"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3314375"},{"key":"ref45","first-page":"6931","article-title":"MARCO: A memory-augmented reinforcement framework for combinatorial optimization","volume-title":"Proc. 33rd Int. Joint Conf. Artif. Intell.","author":"Garmendia"},{"key":"ref46","first-page":"7","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9534083"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3148435"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.13140\/RG.2.2.18893.74727"},{"key":"ref50","first-page":"187","article-title":"Guided policy search","volume-title":"Proc. 30th Int. Conf. Mach. Learn. (ICML)","author":"Levine"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"ref53","article-title":"Evolution strategies as a scalable alternative to reinforcement learning","author":"Tim","year":"2017","journal-title":"arxiv.1703.03864v2"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01126"},{"key":"ref55","first-page":"15580","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gasse"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004964"},{"key":"ref59","article-title":"Multi-objective pointer network for combinatorial optimization","author":"Gao","year":"2022","journal-title":"arXiv:2204.11860"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2023.3312476"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105937"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4235\/11635978\/11082360.pdf?arnumber=11082360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T19:03:08Z","timestamp":1785783788000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11082360\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":61,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2025.3589640","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}