{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:05:34Z","timestamp":1770897934771,"version":"3.50.1"},"reference-count":44,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T00:00:00Z","timestamp":1688860800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004532","name":"Japan International Cooperation Agency (JICA)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004532","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,7,9]]},"DOI":"10.1109\/icmlc58545.2023.10327970","type":"proceedings-article","created":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T14:04:26Z","timestamp":1701180266000},"page":"172-180","source":"Crossref","is-referenced-by-count":2,"title":["Deep Graph Representation Learning to Solve Vehicle Routing Problem"],"prefix":"10.1109","author":[{"given":"Getu","family":"Fellek","sequence":"first","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University,Fukuoka,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Farid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goytom","family":"Gebreyesus","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University,Fukuoka,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Fujimura","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University,Fukuoka,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Yoshie","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University,Fukuoka,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Highway Networks","author":"Srivastava","year":"2015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1907375117"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/mvt.2009.935537"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-008-0224-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2020.1870013"},{"key":"ref7","volume-title":"Neural Machine Translation by Jointly Learning to Align and Translate","author":"Bahdanau","year":"2014"},{"key":"ref8","volume-title":"Solve routing problems with a residual edge-graph attention neural network","author":"Lei","year":"2021"},{"key":"ref9","volume-title":"Learning Combinatorial Optimization Algorithms over Graphs","author":"Dai","year":"2017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/tee.23771"},{"key":"ref11","first-page":"2692","article-title":"Pointer Networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Vinyals","year":"2015"},{"key":"ref12","article-title":"Neural Combinatorial Optimization with Reinforcement Learning","volume-title":"International Conference on Learning Representations","author":"Bello"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2021.3089179"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.2978386"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref16","volume-title":"How Attentive are Graph Attention Networks?","author":"Brody","year":"2021"},{"key":"ref17","volume-title":"Proximal Policy Optimization Algorithms","author":"Schulman","year":"2017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/mprv.2008.80"},{"key":"ref19","article-title":"Graph Attention Networks","volume-title":"International Conference on Learning Representations, 2017","author":"Veli\u010dkovi\u0107"},{"key":"ref20","volume-title":"Semi-Supervised Classification with Graph Convolutional Networks","author":"Kipf","year":"2016"},{"key":"ref21","first-page":"9861","article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing SystemsDecember 2018","author":"Nazari"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref23","volume-title":"Learning Permutations with Sinkhorn Policy Gradient","author":"Emami","year":"2018"},{"key":"ref24","first-page":"1","article-title":"Attention, learn to solve routing problems","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kool","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ieem55944.2022.9989997"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/wiiat50758.2020.00102"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tits.2020.3003163"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403356"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102861"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17430"},{"key":"ref31","author":"Gao","year":"2020","journal-title":"Learn to Design the Heuristics for Vehicle Routing Problem"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.08.005"},{"key":"ref33","volume-title":"Dynamic Partial Removal: A Neural Network Heuristic for Large Neighborhood Search","author":"Chen","year":"2020"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/icmla51294.2020.00013"},{"key":"ref35","volume-title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","author":"Joshi","year":"2019"},{"key":"ref36","article-title":"Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search","author":"Li","year":"2018","journal-title":"Advances in Neural Information Processing Systems 31 (NeurIPS 2018)"},{"key":"ref37","volume-title":"Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization","author":"Cappart","year":"2020"},{"key":"ref38","author":"Parisotto","year":"2020","journal-title":"Stabilizing Transformers for Reinforcement Learning"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48332-7_369"},{"key":"ref40","author":"Helsgaun","year":"2017","journal-title":"An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems"},{"key":"ref41","volume-title":"Google OR Tools","year":"2022"},{"key":"ref42","volume-title":"Residual or Gate? Towards Deeper Graph Neural Networks for Inductive Graph Representation Learning","author":"Huang","year":"2019"},{"key":"ref43","volume-title":"Gated Graph Sequence Neural Networks","author":"Li","year":"2015"},{"key":"ref44","volume-title":"Deep Residual Learning for Image Recognition","author":"He","year":"2015"}],"event":{"name":"2023 International Conference on Machine Learning and Cybernetics (ICMLC)","location":"Adelaide, Australia","start":{"date-parts":[[2023,7,9]]},"end":{"date-parts":[[2023,7,11]]}},"container-title":["2023 International Conference on Machine Learning and Cybernetics (ICMLC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10327787\/10327919\/10327970.pdf?arnumber=10327970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T17:50:46Z","timestamp":1761587446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10327970\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,9]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/icmlc58545.2023.10327970","relation":{},"subject":[],"published":{"date-parts":[[2023,7,9]]}}}