{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:00:22Z","timestamp":1755219622972,"version":"3.43.0"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2024YFF0617700"],"award-info":[{"award-number":["2024YFF0617700"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23A20309","62372296","62272302"],"award-info":[{"award-number":["U23A20309","62372296","62272302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Municipal Science and Technology Major Project","award":["2021SHZDZX0102"],"award-info":[{"award-number":["2021SHZDZX0102"]}]},{"name":"CCF-DiDi GAIA Collaborative Research Funds for Young Scholars","award":["202404"],"award-info":[{"award-number":["202404"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1109\/tmc.2025.3549757","type":"journal-article","created":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T15:06:32Z","timestamp":1742828792000},"page":"7866-7879","source":"Crossref","is-referenced-by-count":0,"title":["A Lightweight Encoder-Decoder Framework for Carpooling Route Planning"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7155-8250","authenticated-orcid":false,"given":"Yucen","family":"Gao","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, College of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5712-2143","authenticated-orcid":false,"given":"Li","family":"Ma","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, College of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5967-2532","authenticated-orcid":false,"given":"Zhemeng","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, College of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songjian","family":"Zhang","sequence":"additional","affiliation":[{"name":"Didi Global Inc., Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Gao","sequence":"additional","affiliation":[{"name":"Didi Global Inc., Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6083-1234","authenticated-orcid":false,"given":"Jun","family":"Fang","sequence":"additional","affiliation":[{"name":"Didi Global Inc., Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1776-8799","authenticated-orcid":false,"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Scalable Computing and Systems, College of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210153"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424574"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2760880"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-024-3452-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-024-40459-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114972"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3648328"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565849"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tra.2020.02.008"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TGCN.2021.3086001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2865893"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3095946"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01939836"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00058"},{"key":"ref17","first-page":"2692","article-title":"Pointer networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Vinyals"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-73194-6_40"},{"key":"ref19","first-page":"1","article-title":"Attention, learn to solve routing problems","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kool"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403356"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539037"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17476"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539084"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM54844.2022.00069"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968113"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-49193-1_26"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00038"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482272"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00070"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and its Variations","author":"Gutin","year":"2007"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.04.047"},{"key":"ref36","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref37","first-page":"26","article-title":"Computing point-to-point shortest paths from external memory","volume-title":"Proc. Workshop Algorithm Eng. Experiments Analytic Algorithmics Combinatorics","author":"Goldberg"},{"key":"ref38","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref39","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velickovic"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref41","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681985"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291014"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-019-0060-3"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7755\/11116789\/10938355.pdf?arnumber=10938355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T05:08:16Z","timestamp":1754543296000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10938355\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":44,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2025.3549757","relation":{},"ISSN":["1536-1233","1558-0660","2161-9875"],"issn-type":[{"type":"print","value":"1536-1233"},{"type":"electronic","value":"1558-0660"},{"type":"electronic","value":"2161-9875"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}