{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:36:41Z","timestamp":1758875801288,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T00:00:00Z","timestamp":1591747200000},"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":[[2020,6,10]]},"DOI":"10.1109\/icps48405.2020.9274782","type":"proceedings-article","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T21:54:11Z","timestamp":1607118851000},"page":"303-308","source":"Crossref","is-referenced-by-count":3,"title":["Complex Vehicle Routing with Memory Augmented Neural Networks"],"prefix":"10.1109","author":[{"given":"Marijn","family":"van Knippenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Holenderski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlado","family":"Menkovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Learning heuristics over large graphs via deep reinforcement learning","author":"mittal","year":"2019","journal-title":"CoRR"},{"key":"ref11","article-title":"Deep learning assisted heuristic tree search for the container pre-marshalling problem","author":"hottung","year":"2017","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1038\/nature20101","article-title":"Hybrid computing using a neural network with dynamic external memory","volume":"538","author":"graves","year":"2016","journal-title":"Nature"},{"key":"ref14","first-page":"3621","article-title":"Scaling memory-augmented neural networks with sparse reads and writes","author":"rae","year":"0"},{"key":"ref15","first-page":"2692","article-title":"Pointer networks","author":"vinyals","year":"0"},{"article-title":"Order matters: Sequence to sequence for sets","year":"0","author":"vinyals","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"ref19","article-title":"An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems","author":"helsgaun","year":"2017","journal-title":"Technical Report Roskilde University Tech Rep"},{"key":"ref4","article-title":"How powerful are graph neural networks?","author":"xu","year":"2018","journal-title":"CoRR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.15"},{"article-title":"Attention, learn to solve routing problems!","year":"2018","author":"kool","key":"ref6"},{"key":"ref5","first-page":"9861","article-title":"Reinforcement learning for solving the vehicle routing problem","author":"nazari","year":"0"},{"key":"ref8","article-title":"Learning the multiple traveling salesmen problem with permutation invariant pooling networks","author":"kaempfer","year":"2018","journal-title":"CoRR"},{"key":"ref7","first-page":"6351","article-title":"Learning combinatorial optimization algorithms over graphs","author":"khalil","year":"0"},{"article-title":"A new dog learns old tricks: Rl finds classic optimization algorithms","year":"2018","author":"kong","key":"ref2"},{"article-title":"Machine learning for combinatorial optimization: a methodological tour d’horizon","year":"2018","author":"bengio","key":"ref1"},{"key":"ref9","article-title":"Graph2seq: Scalable learning dynamics for graphs","author":"venkatakrishnan","year":"2018","journal-title":"CoRR"},{"key":"ref20","article-title":"Deep reinforcement learning for multi-agent systems: A review of challenges, solutions and applications","author":"nguyen","year":"2018","journal-title":"CoRR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219993"}],"event":{"name":"2020 IEEE Conference on Industrial Cyberphysical Systems (ICPS)","start":{"date-parts":[[2020,6,10]]},"location":"Tampere, Finland","end":{"date-parts":[[2020,6,12]]}},"container-title":["2020 IEEE Conference on Industrial Cyberphysical Systems (ICPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9274544\/9274545\/09274782.pdf?arnumber=9274782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T20:08:00Z","timestamp":1656360480000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9274782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icps48405.2020.9274782","relation":{},"subject":[],"published":{"date-parts":[[2020,6,10]]}}}