{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T19:01:49Z","timestamp":1764788509422,"version":"3.46.0"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100007845","name":"Huree College of Information and Communication Technology Under a Research Grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007845","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3636146","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T19:01:12Z","timestamp":1764010872000},"page":"199719-199727","source":"Crossref","is-referenced-by-count":0,"title":["An Enhanced GNN Encoder-Based Approach to the Vehicle Routing Problem With Task Priority and Limited Resources"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-5806-8566","authenticated-orcid":false,"given":"Kwangcheol","family":"Shin","sequence":"first","affiliation":[{"name":"Department of Computer Science, Huree College of Information and Communication Technology, Ulaanbaatar, Mongolia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uyanga","family":"Otgonbayar","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Huree College of Information and Communication Technology, Ulaanbaatar, Mongolia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youngmi","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Huree College of Information and Communication Technology, Ulaanbaatar, Mongolia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The Vehicle Routing Problem","author":"Toth","year":"2002"},{"key":"ref3","first-page":"367","article-title":"Vehicle routing","volume-title":"Handbooks in Operations Research and Management Science","volume":"14","author":"Cordeau","year":"2007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.123691"},{"volume-title":"Comput. Intractability: A Guide to Theory NP-Completeness","year":"1979","author":"Garey","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"article-title":"Attention, learn to solve routing problems!","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kool","key":"ref8"},{"key":"ref9","first-page":"9861","article-title":"Reinforcement learning for solving the vehicle routing problem","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"31","author":"Nazari"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref11","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"28","author":"Vinyals"},{"article-title":"Neural combinatorial optimization with reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Bello","key":"ref12"},{"key":"ref13","first-page":"6348","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Dai"},{"key":"ref14","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019","journal-title":"arXiv:1906.01227"},{"key":"ref15","first-page":"1621","article-title":"Learning to dispatch for job shop scheduling via deep reinforcement learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Zhang"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.5755\/j01.itc.49.2.24613"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1561\/2200000071"},{"article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kipf","key":"ref18"},{"article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Veli\u010dkovi\u0107","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3546952"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11264544.pdf?arnumber=11264544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:43:59Z","timestamp":1764787439000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11264544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3636146","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}