{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T22:41:15Z","timestamp":1780612875182,"version":"3.54.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271222"],"award-info":[{"award-number":["72271222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["W2411062"],"award-info":[{"award-number":["W2411062"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871203"],"award-info":[{"award-number":["71871203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/lra.2025.3568309","type":"journal-article","created":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T17:40:54Z","timestamp":1746726054000},"page":"6432-6439","source":"Crossref","is-referenced-by-count":4,"title":["Deep Reinforcement Learning for Solving Two-Echelon Capacity Vehicle Routing Problem: An End-to-End Method"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9165-2355","authenticated-orcid":false,"given":"Weice","family":"Sun","sequence":"first","affiliation":[{"name":"College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6808-1490","authenticated-orcid":false,"given":"Zhi","family":"Pei","sequence":"additional","affiliation":[{"name":"College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.02.022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"ref3","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"28","author":"Vinyals","year":"2015,"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nature14236"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref6","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman","year":"2014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.191"},{"key":"ref8","article-title":"The two-echelon capacitated vehicle routing problem","author":"G. Feliu","year":"2008"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0399"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1153"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2013.0500"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104833"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0368"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.04.007"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.014"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2017.09.018"},{"key":"ref18","first-page":"11","article-title":"A neighborhood search and set cover hybrid heuristic for the two-echelon vehicle routing problem","volume-title":"Proc. 18th workshop Algorithmic Approaches Transp. Modelling, Optim., Syst. (atmos 2018)","author":"Amarouche","year":"2018"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.034"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.11.005"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2016.09.012"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1162"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2024.104522"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/10969146\/10993322.pdf?arnumber=10993322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T17:16:53Z","timestamp":1747761413000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10993322\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":24,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3568309","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}