{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:48:32Z","timestamp":1730303312898,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/vtc2021-spring51267.2021.9448741","type":"proceedings-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T20:27:03Z","timestamp":1623788823000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Distance-Based Neural Combinatorial Optimization for Context-based Route Planning"],"prefix":"10.1109","author":[{"given":"Sascha","family":"Hamzehi","sequence":"first","affiliation":[{"name":"Technical University Munich,Chair of Traffic Engineering and Control,Munich,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Bogenberger","sequence":"additional","affiliation":[{"name":"Technical University Munich,Chair of Traffic Engineering and Control,Munich,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Kaltenh\u00e4user","sequence":"additional","affiliation":[{"name":"DHBW State University,Faculty of Economics,Villingen-Schwenningen,Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jilei","family":"Tian","sequence":"additional","affiliation":[{"name":"BMW Technology Corporation,BMW Group,Chicago,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alvin","family":"Chin","sequence":"additional","affiliation":[{"name":"BMW Technology Corporation,BMW Group,Chicago,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Cao","sequence":"additional","affiliation":[{"name":"BMW Technology Corporation,BMW Group,Chicago,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Neural combinatorial optimization with reinforcement learning","year":"2016","author":"Bello","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2019.8916920"},{"article-title":"Playing atari with deep reinforcement learning","volume-title":"NIPS Deep Learning Workshop","author":"Volodymyr","key":"ref3"},{"volume-title":"Google OR-Tools","year":"2016","key":"ref4"},{"key":"ref5","first-page":"496","volume-title":"The euclidean traveling salesman problem is np-complete","author":"Papadimitriou","year":"1977"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30241-2_49"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"volume-title":"The traveling salesman problem: a computational study","year":"2006","author":"Applegate","key":"ref8"},{"key":"ref9","first-page":"2692","article-title":"Pointer networks","author":"Vinyals","year":"2015","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref10","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","author":"Khalil","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"9839","article-title":"Reinforcement learning for solving the vehicle routing problem","author":"Nazari","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/fic\/055\/03"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1034"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_30"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICMSAO.2019.8880293"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36478-1_8"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","article-title":"Stochastic and dynamic networks and routing","volume":"8","author":"Powell","year":"1995","journal-title":"Handbooks in operations research and management science"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00051-5"},{"volume-title":"The traveling salesman: computational solutions for TSP applications","year":"1994","author":"Reinelt","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.04.003"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICICIC.2006.40"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400884179"},{"issue":"1","key":"ref26","first-page":"6","article-title":"A study of sufficient conditions for hamiltonian cycles","volume":"1","author":"DeLeon","year":"2000","journal-title":"Rose-Hulman Undergraduate Mathematics Journal"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73611-9"},{"volume-title":"The genesis of the abstract group concept: a contribution to the history of the origin of abstract group theory","year":"2007","author":"Wussing","key":"ref28"},{"article-title":"Mish: A self regularized non-monotonic neural activation function","year":"2019","author":"Misra","key":"ref29"},{"key":"ref30","first-page":"1057","article-title":"Policy gradient methods for reinforcement learning with function approximation","volume-title":"NIPs","volume":"99","author":"Sutton","year":"1999"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.31390\/gradschool_dissertations.4601"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1506.02142"},{"article-title":"Adam: A method for stochastic gradient descent","volume-title":"ICLR: International Conference on Learning Representations","author":"Kingma","key":"ref34"}],"event":{"name":"2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)","start":{"date-parts":[[2021,4,25]]},"location":"Helsinki, Finland","end":{"date-parts":[[2021,4,28]]}},"container-title":["2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9448628\/9448629\/09448741.pdf?arnumber=9448741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T05:32:54Z","timestamp":1725341574000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9448741\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/vtc2021-spring51267.2021.9448741","relation":{},"subject":[],"published":{"date-parts":[[2021,4]]}}}