{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:28Z","timestamp":1740169288634,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit? e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2022.3233852","type":"journal-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T21:51:50Z","timestamp":1672782710000},"page":"2001-2011","source":"Crossref","is-referenced-by-count":3,"title":["Learned Upper Bounds for the Time-Dependent Travelling Salesman Problem"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9505-5869","authenticated-orcid":false,"given":"Tommaso","family":"Adamo","sequence":"first","affiliation":[{"name":"Department of Engineering for Innovation, University of Salento, Lecce, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianpaolo","family":"Ghiani","sequence":"additional","affiliation":[{"name":"Department of Engineering for Innovation, University of Salento, Lecce, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierpaolo","family":"Greco","sequence":"additional","affiliation":[{"name":"Department of Engineering for Innovation, University of Salento, Lecce, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8959-5017","authenticated-orcid":false,"given":"Emanuela","family":"Guerriero","sequence":"additional","affiliation":[{"name":"Department of Engineering for Innovation, University of Salento, Lecce, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.rser.2021.111567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125072"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.06.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.3.185"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00299-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23529-9_12"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4371(02)01078-6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2012.17"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0449"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/net.21830"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18008-3_1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104795"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.09.099"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.017"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.06.026"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0911"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106078"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00075-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0181"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref21","first-page":"1","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Vinyals"},{"key":"ref22","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016","journal-title":"arXiv:1611.09940"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_15"},{"key":"ref24","first-page":"12","article-title":"A comparative study of machine learning heuristic algorithms to solve the traveling salesman problem","volume-title":"Proc. 3rd Int. Conf. Appl. Digit. Inf. Web Technol. (ICADIWT)","author":"Uslan"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.3390\/a13120340"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105446"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00147-9"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94463-0"},{"key":"ref29","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","volume-title":"Proc. 5th Berkeley Symp. Math. Statist. Prob.","volume":"1","author":"MacQueen"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/212066.212081"},{"volume-title":"Deep Learning","year":"2016","author":"Goodfellow","key":"ref31"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10005081.pdf?arnumber=10005081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T04:44:58Z","timestamp":1707453898000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10005081\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3233852","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}