{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:10:25Z","timestamp":1781194225585,"version":"3.54.1"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union through the Italian National Recovery and Resilience Plan (NRRP) of NextGenerationEU, partnership on \u201cTelecommunications of the Future\u201d","award":["PE00000001"],"award-info":[{"award-number":["PE00000001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Serv. Manage."],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1109\/tnsm.2023.3287433","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T18:07:45Z","timestamp":1687198065000},"page":"108-119","source":"Crossref","is-referenced-by-count":8,"title":["DeepLS: Local Search for Network Optimization Based on Lightweight Deep Reinforcement Learning"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1524-8178","authenticated-orcid":false,"given":"Nicola","family":"Di Cicco","sequence":"first","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico Di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9823-8206","authenticated-orcid":false,"given":"Memedhe","family":"Ibrahimi","sequence":"additional","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico Di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4712-3767","authenticated-orcid":false,"given":"Sebastian","family":"Troia","sequence":"additional","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico Di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0740-1061","authenticated-orcid":false,"given":"Massimo","family":"Tornatore","sequence":"additional","affiliation":[{"name":"Department of Electronics, Information and Bioengineering, Politecnico Di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845132"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1364\/OFC.2022.Th3D.4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP52444.2021.9651930"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICIN53892.2022.9758091"},{"key":"ref5","first-page":"1","article-title":"Deep-RMSA: A deep-reinforcement-learning routing, modulation and spectrum assignment agent for elastic optical networks","volume-title":"Proc. Opt. Fiber Commun. Conf. Expo. (OFC)","author":"Chen"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSTQE.2022.3151323"},{"key":"ref7","volume-title":"Neural simulated annealing","author":"Correia","year":"2022"},{"key":"ref8","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"arXiv:1611.09940"},{"key":"ref9","first-page":"1","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals"},{"key":"ref10","first-page":"15554","article-title":"Exact combinatorial optimization with graph convolutional neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Gasse"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref12","volume-title":"EURO Meets NeurIPS 2022","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787495"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152441"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00056"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2019.2924345"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-022-04612-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105272"},{"key":"ref19","first-page":"3391","article-title":"Deep sets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Zaheer"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tnn.1998.712192"},{"key":"ref21","volume-title":"Is the policy gradient a gradient?","author":"Nota","year":"2019"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2021.103535","article-title":"Reward is enough","volume":"299","author":"Silver","year":"2021","journal-title":"Artif. Intell."},{"key":"ref23","volume-title":"Playing atari with deep reinforcement learning","author":"Mnih","year":"2013"},{"key":"ref24","volume-title":"Continuous control with deep reinforcement learning","author":"Lillicrap","year":"2015"},{"key":"ref25","volume-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-019-1724-z"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref28","first-page":"1","article-title":"On the bottleneck of graph neural networks and its practical implications","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Alon"},{"key":"ref29","first-page":"1","article-title":"Graph-less neural networks: Teaching old MLPs new tricks via distillation","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref30","volume-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.94"},{"issue":"268","key":"ref32","first-page":"1","article-title":"Stable-baselines3: Reliable reinforcement learning implementations","volume":"22","author":"Raffin","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","volume-title":"DEFO website","author":"Hartert","year":"2015"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2013.6798402"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ECOC52684.2021.9605845"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_41"}],"container-title":["IEEE Transactions on Network and Service Management"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4275028\/10423826\/10155296.pdf?arnumber=10155296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T23:47:14Z","timestamp":1707868034000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10155296\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":36,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnsm.2023.3287433","relation":{},"ISSN":["1932-4537","2373-7379"],"issn-type":[{"value":"1932-4537","type":"electronic"},{"value":"2373-7379","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]}}}