{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:58Z","timestamp":1775912998646,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP230100081"],"award-info":[{"award-number":["DP230100081"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT180100140"],"award-info":[{"award-number":["FT180100140"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tits.2024.3396173","type":"journal-article","created":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T17:30:03Z","timestamp":1715362203000},"page":"14220-14232","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Alternative Route Planning in Road Networks"],"prefix":"10.1109","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3235-2839","authenticated-orcid":false,"given":"Ahmed","family":"Fahmin","sequence":"first","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojie","family":"Shen","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2139-9121","authenticated-orcid":false,"given":"Muhammad","family":"Aamir Cheema","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5655-5337","authenticated-orcid":false,"given":"Adel N.","family":"Toosi","sequence":"additional","affiliation":[{"name":"Faculty of Information Technology, Monash University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0384-7616","authenticated-orcid":false,"given":"Mohammed","family":"Eunus Ali","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka, Bangladesh"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972863.13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v31i1.15977"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164141"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3292390.3292394"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26463"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3357000.3366141"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13556"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561563"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3063717"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407822"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3474717.3483955"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/itor.13060"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551863"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2006.889437"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_52"},{"key":"ref19","volume-title":"Method of and apparatus for generating routes","author":"Jones","year":"2012"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0041-8"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773492"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3274895.3274903"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00604-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19754-3_5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-023-01188-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2172\/1453875"},{"key":"ref29","first-page":"156","article-title":"Computing the shortest path: A\u2217 search meets graph theory","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074\/03"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074\/02"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2444016.2444020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v32i1.19818"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2021.3061879"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2023.3241930"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-8364-1"},{"key":"ref39","first-page":"94","article-title":"Evolution and evaluation of the penalty method for alternative graphs","volume-title":"Proc. 13th Workshop Algorithmic Approaches Transp. Model., Optim.","volume":"33","author":"Kobitzsch"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/10705407\/10528790.pdf?arnumber=10528790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T02:46:07Z","timestamp":1733885167000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10528790\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tits.2024.3396173","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"value":"1524-9050","type":"print"},{"value":"1558-0016","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}