{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:04:35Z","timestamp":1743105875562,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819612413"},{"type":"electronic","value":"9789819612420"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_15","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:07:34Z","timestamp":1733990854000},"page":"195-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Shortest Path Computation for\u00a0Electric Vehicles in\u00a0Time-Dependent Networks"],"prefix":"10.1007","author":[{"given":"Faisal","family":"Alam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojie","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chetan","family":"Arora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"15_CR1","unstructured":"https:\/\/www.eea.europa.eu\/\/publications\/transport-and-environment-report-2022 . Accessed 24 Aug 2024"},{"key":"15_CR2","unstructured":"Energy consumption of full electric vehicles cheatsheet - ev database. https:\/\/ev-database.org\/cheatsheet\/energy-consumption-electric-car. Accessed 24 Aug 2024"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Artmeier, A., Haselmayr, J., Leucker, M., Sachenbacher, M.: The shortest path problem revisited: optimal routing for electric vehicles. In: Deutsche Jahrestagung f\u00fcr K\u00fcnstliche Intelligenz (2010)","DOI":"10.1007\/978-3-642-16111-7_35"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Delling, D., Sanders, P., Vetter, C.: Time-dependent contraction hierarchies. In: Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, 3 January 2009, pp. 97\u2013105. SIAM (2009)","DOI":"10.1137\/1.9781611972894.10"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Batz, G.V., Geisberger, R., Sanders, P., Vetter, C.: Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics 18 (2013)","DOI":"10.1145\/2444016.2444020"},{"issue":"1\u20132","key":"15_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00450-014-0287-3","volume":"31","author":"M Baum","year":"2016","unstructured":"Baum, M., Dibbelt, J., Gemsa, A., Wagner, D.: Towards route planning algorithms for electric vehicles with realistic constraints. Comput. Sci. Res. Dev. 31(1\u20132), 105\u2013109 (2016)","journal-title":"Comput. Sci. Res. Dev."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Z\u00fcndorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2015. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2820783.2820826"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1007\/s00453-019-00655-9","volume":"82","author":"M Baum","year":"2020","unstructured":"Baum, M., Dibbelt, J., Pajor, T., Sauer, J., Wagner, D., Z\u00fcndorf, T.: Energy-optimal routes for battery electric vehicles. Algorithmica 82, 1490\u20131546 (2020)","journal-title":"Algorithmica"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/s00453-009-9341-0","volume":"60","author":"D Delling","year":"2011","unstructured":"Delling, D.: Time-dependent Sharc-routing. Algorithmica 60(1), 60\u201394 (2011)","journal-title":"Algorithmica"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1287\/ijoc.1110.0448","volume":"24","author":"D Delling","year":"2012","unstructured":"Delling, D., Nannicini, G.: Core routing on dynamic time-dependent road networks. INFORMS J. Comput. 24(2), 187\u2013201 (2012)","journal-title":"INFORMS J. Comput."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Derrow-Pinion, A., et al.: ETA prediction with graph neural networks in google maps. In: CIKM 2021: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, 1\u20135 November 2021, pp. 3767\u20133776. ACM (2021)","DOI":"10.1145\/3459637.3481916"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"15_CR13","unstructured":"evesco: LEVELS OF EV CHARGING (2024). https:\/\/www.power-sonic.com\/blog\/levels-of-ev-charging\/. Accessed 25 Mar 2024"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: Experimental Algorithms, 7th International Workshop, WEA, vol.\u00a05038, pp. 319\u2013333 (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"15_CR15","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, 23\u201325 January 2005, pp. 156\u2013165 (2005)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: efficient point-to-point shortest path algorithms. In: ALENEX, pp. 129\u2013143 (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"15_CR17","unstructured":"Green Vehicle Guide: Vehicle emissions (2023). https:\/\/www.greenvehicleguide.gov.au\/pages\/UnderstandingEmissions\/VehicleEmissions. Accessed 29 Mar 2024"},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE trans. Syst. Sci. Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE trans. Syst. Sci. Cybern."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast point-to-point shortest path computations with arc-flags. In: Proceedings of a DIMACS Workshop on the Shortest Path Problem, vol.\u00a074, pp. 41\u201372 (2006)","DOI":"10.1090\/dimacs\/074\/03"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Knez, D., Duman\u010di\u0107, A., Erdeli\u0107, T., Marde\u0161i\u0107, N.: Solving shortest energy and time-dependent travel time path problems on a small-sized road network. In: 2023 International Symposium ELMAR, pp. 33\u201336. IEEE (2023)","DOI":"10.1109\/ELMAR59410.2023.10253923"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Lauther, U.: An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags. In: Proceedings of a DIMACS Workshop on the Shortest Path Problem, vol.\u00a074, pp. 19\u201339 (2006)","DOI":"10.1090\/dimacs\/074\/02"},{"issue":"1","key":"15_CR22","first-page":"300","volume":"34","author":"L Li","year":"2022","unstructured":"Li, L., Wang, S., Zhou, X.: Fastest path query answering using time-dependent hop-labeling in road network. IEEE Trans. Knowl. Data Eng. 34(1), 300\u2013313 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10707-016-0274-x","volume":"21","author":"Y Liu","year":"2017","unstructured":"Liu, Y., Seah, H.S., Shou, G.: Constrained energy-efficient routing in time-aware road networks. GeoInformatica 21(1), 89\u2013117 (2017). https:\/\/doi.org\/10.1007\/s10707-016-0274-x","journal-title":"GeoInformatica"},{"key":"15_CR24","unstructured":"Michel, G., Nikolentzos, G., Lutzeyer, J.F., Vazirgiannis, M.: Path neural networks: Expressive and accurate graph neural networks. In: International Conference on Machine Learning, ICML 2023, 23-29 July 2023, Honolulu, Hawaii, USA. Proceedings of Machine Learning Research, vol.\u00a0202, pp. 24737\u201324755. PMLR (2023)"},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1002\/net.20438","volume":"59","author":"G Nannicini","year":"2012","unstructured":"Nannicini, G., Delling, D., Schultes, D., Liberti, L.: Bidirectional A* search on time-dependent road networks. Networks 59(2), 240\u2013251 (2012)","journal-title":"Networks"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Pohl, I.: Bi-directional and heuristic search in path problems. Ph.D. thesis, Stanford Linear Accelerator Center, USA (1969)","DOI":"10.2172\/1453875"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: ESA. Lecture Notes in Computer Science, vol.\u00a03669, pp. 568\u2013579. Springer, Cham (2005)","DOI":"10.1007\/11561071_51"},{"key":"15_CR28","doi-asserted-by":"publisher","unstructured":"Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Improving time-dependent contraction hierarchies. In: Proceedings of the International Conference on Automated Planning and Scheduling, vol. 32, no. 1, pp. 338\u2013347 (2022). https:\/\/doi.org\/10.1609\/icaps.v32i1.19818","DOI":"10.1609\/icaps.v32i1.19818"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Improving time-dependent contraction hierarchies. In: Kumar, A., Thi\u00e9baux, S., Varakantham, P., Yeoh, W. (eds.) Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (virtual), 13\u201324 June 2022, pp. 338\u2013347. AAAI Press (2022)","DOI":"10.1609\/icaps.v32i1.19818"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tre.2017.02.002","volume":"101","author":"N Shi","year":"2017","unstructured":"Shi, N., Zhou, S., Wang, F., Tao, Y., Liu, L.: The multi-criteria constrained shortest path problem. Transp. Res. Part E: Logist. Transp. Rev. 101, 13\u201329 (2017)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Storandt, S.: Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science, IWCTS 2012, pp. 20\u201325. Association for Computing Machinery, New York (2012)","DOI":"10.1145\/2442942.2442947"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Sun, X., Cheng, H., Li, J., Liu, B., Guan, J.: All in one: multi-task prompting for graph neural networks. In: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2023, Long Beach, CA, USA, 6\u201310 August 2023, pp. 2120\u20132131. ACM (2023)","DOI":"10.1145\/3580305.3599256"},{"issue":"10","key":"15_CR33","doi-asserted-by":"publisher","first-page":"18423","DOI":"10.1109\/TITS.2022.3168590","volume":"23","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Zheng, J., Du, Y., Huang, C., Li, P.: Traffic-GGNN: predicting traffic flow via attentional spatial-temporal gated graph neural networks. IEEE Trans. Intell. Transp. Syst. 23(10), 18423\u201318432 (2022). https:\/\/doi.org\/10.1109\/TITS.2022.3168590","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"3","key":"15_CR34","doi-asserted-by":"publisher","first-page":"320","DOI":"10.14778\/3368289.3368297","volume":"13","author":"Y Zeng","year":"2019","unstructured":"Zeng, Y., Tong, Y., Chen, L.: Last-mile delivery made practical: an efficient route planning framework with theoretical guarantees. Proc. VLDB Endow. 13(3), 320\u2013333 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"15_CR35","unstructured":"Zhang, S., Chen, H., Yang, H., Sun, X., Yu, P.S., Xu, G.: Graph masked autoencoders with transformers. arXiv preprint arXiv:2202.08391 (2022)"},{"issue":"1","key":"15_CR36","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/TKDE.2018.2879819","volume":"32","author":"B Zheng","year":"2020","unstructured":"Zheng, B., et al.: Answering why-not group spatial keyword queries. IEEE Trans. Knowl. Data Eng. 32(1), 26\u201339 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1242-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:04:14Z","timestamp":1736193854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}