{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,3]],"date-time":"2026-11-03T13:35:56Z","timestamp":1793712956414,"version":"4.6.1"},"reference-count":103,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62572414"],"award-info":[{"award-number":["62572414"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangdong-Hong Kong Technology Innovation Joint Funding Scheme","award":["2024A0505040012"],"award-info":[{"award-number":["2024A0505040012"]}]},{"name":"Hong Kong Research Grants Council","award":["T43-513\/23-N"],"award-info":[{"award-number":["T43-513\/23-N"]}]},{"name":"Hong Kong Research Grants Council","award":["T22-607\/24N"],"award-info":[{"award-number":["T22-607\/24N"]}]},{"name":"Hong Kong Jockey Club Charities Trust"},{"name":"JC STEM Lab of Data Science Foundations"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tkde.2026.3671321","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:03:12Z","timestamp":1772830992000},"page":"2880-2897","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Diversified Routing System"],"prefix":"10.1109","volume":"38","author":[{"given":"Zihan","family":"Luo","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science, Technology, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science, Technology, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8155-4942","authenticated-orcid":false,"given":"Mengxuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"The Australian National University, Canberra, ACT, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6343-1455","authenticated-orcid":false,"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science, Technology, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-002-0010-2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.05.109"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871504"},{"key":"ref5","first-page":"133","article-title":"Efficiently computing top-K shortest path join","volume-title":"Proc. 18th Int. Conf. Extending Database Technol.","author":"Chang"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389735"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9154"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00035"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773492"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274903"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00604-x"},{"key":"ref14","first-page":"414","article-title":"Exact and approximate algorithms for finding K-shortest paths with limited overlap","volume-title":"Proc. 20th Int. Conf. Extending Database Technol.: EDBT","author":"Chondrogiannis"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820858"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_52"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_23"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3483955"},{"key":"ref19","first-page":"1","volume-title":"Diversity in Routing: From Vertices and Edges to Paths","author":"Li","year":"2017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767844"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2735471.2735475"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407822"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29038-1_41"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00194"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00350"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3439409"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.06.003"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-025-00940-w"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3520580"},{"key":"ref30","first-page":"53","article-title":"Finding diverse shortest paths for the routing task in wireless sensor networks","volume-title":"Proc. Int. Conf. Syst. Netw. Commun.","author":"Henao-Mazo"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0061-4"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref35","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref36","first-page":"11313","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. J. Int. Conf. Learn. Representations","author":"Welling"},{"key":"ref37","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref38","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113313"},{"key":"ref43","first-page":"539","article-title":"Hazardous materials transportation","volume":"14","author":"Erkut","year":"2007","journal-title":"Handbooks Oper. Res. Manage. Sci."},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.5.625"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0378-1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3063717"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00142"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595916500421"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3010005"},{"key":"ref52","article-title":"9th dimacs implementation challenge - shortest paths"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3396173"},{"key":"ref54","first-page":"18932","article-title":"Revisiting deep learning models for tabular data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gorishniy"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref56","first-page":"5724","article-title":"Tabular data modeling via contextual embeddings","volume-title":"Proc. Int. Conf. Learn. Representations (ICLR) Workshop Weakly Supervised Learn.","author":"Huang"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref59","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476267"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00348"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749456"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137638"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00085"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-018-0499-4"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981062"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00758-w"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2019.00-69"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015277"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732941"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551856"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00760-2"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00322"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00038"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2399306"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457394"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00135-z"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3043250"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2019.2935152"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403043"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3346377"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.14778\/3587136.3587151"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-77850-6_8"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457290"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00118"},{"issue":"4","key":"ref93","first-page":"463","article-title":"Hop-constrained st simple path enumeration: Towards bridging theory and practice","volume-title":"Proc. VLDB Endow.","volume":"13","author":"Peng","year":"2019"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1145\/3639277"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2025.3532318"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389737"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00074"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00198"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"ref100","first-page":"12029","article-title":"Path planning using neural a* search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yonetani"},{"issue":"12","key":"ref101","first-page":"906","article-title":"Optimizing path planning for mobile robots: An ann-based approach for static obstacle navigation","volume":"12","author":"Muhammad","year":"2024","journal-title":"Int. J. Creative Res. Thoughts IJCRT"},{"key":"ref102","article-title":"A universal scheme for dynamic partitioned shortest path index","author":"Zhang","year":"2023"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE65448.2025.00092"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11479420\/11424330.pdf?arnumber=11424330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:21:09Z","timestamp":1775881269000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11424330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":103,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2026.3671321","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}