{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:04:04Z","timestamp":1772935444951,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100007156","name":"Innovation and Technology Commission of Hong Kong SAR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/bigdata66926.2025.11401019","type":"proceedings-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T20:57:57Z","timestamp":1772830677000},"page":"1994-2003","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Time-Dependent Shortest Path Finding on Cargo Network"],"prefix":"10.1109","author":[{"given":"Elton Chun-Chai","family":"Li","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology,Department of CSE,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyi","family":"Liu","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology,Department of CSE,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiyuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Hong Kong Generative AI Research and Development Center (HKGAI),Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean Shing-Fung","family":"Lau","sequence":"additional","affiliation":[{"name":"Hong Kong Industrial Artificial Intelligence & Robotics Centre (FLAIR),Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehong","family":"Xu","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology,Department of CSE,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology,Department of CSE,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Global air cargo demand achieves record growth in 2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2006.885193"},{"key":"ref3","volume-title":"What to know about air cargo handling"},{"key":"ref4","volume-title":"Warehouse & distribution science: release 0.98.1","author":"Bartholdi","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref6","volume-title":"Introduction to Algorithms, Third Edition","author":"Cormen","year":"2009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2014.02.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.03.015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2017.05.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.05.064"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref13","volume-title":"Network Science","author":"Barabasi","year":"2016"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00155"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551856"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00760-2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00322"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref21","article-title":"Automatic routing system for intelligent warehouses","author":"Vivaldini","year":"2023","journal-title":"arXiv preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CCIS57298.2022.10016376"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2023.1369.1379"},{"issue":"1","key":"ref24","first-page":"1","article-title":"Decentralized routing algorithm with physical time windows for modular conveyors","volume":"13","author":"Sohrt","year":"2020","journal-title":"Logistics Research"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.21834\/jabs.v8i25.425"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SACI.2012.6249977"},{"key":"ref27","article-title":"A survey of shortest-path algorithms","author":"Madkour","year":"2017","journal-title":"arXiv preprint"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_25"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"}],"event":{"name":"2025 IEEE International Conference on Big Data (BigData)","location":"Macau, China","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,11]]}},"container-title":["2025 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11400704\/11400712\/11401019.pdf?arnumber=11401019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T07:32:40Z","timestamp":1772868760000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11401019\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/bigdata66926.2025.11401019","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}