{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:52:49Z","timestamp":1743011569705,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819755714"},{"type":"electronic","value":"9789819755721"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-5572-1_16","type":"book-chapter","created":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T23:03:11Z","timestamp":1725058991000},"page":"252-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Global Route Planning for\u00a0Large-Scale Requests on Traffic-Aware Road Network"],"prefix":"10.1007","author":[{"given":"JiaJia","family":"Li","sequence":"first","affiliation":[]},{"given":"Yannan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Na","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings","author":"I Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) Algorithms \u2013 ESA 2012: 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, pp. 24\u201335. Springer Berlin Heidelberg, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_4"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: WWW 2014, pp. 237\u2013248. ACM (2014)","DOI":"10.1145\/2566486.2568007"},{"key":"16_CR3","unstructured":"Board, T.: Transportation research board special report 309: (2012)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chen, L., Shang, S., Yao, B., Li, J.: Pay your trip for traffic congestion: dynamic pricing in traffic-aware road networks. In: IAAI 2020, pp. 582\u2013589. AAAI (2020)","DOI":"10.1609\/aaai.v34i01.5397"},{"issue":"3","key":"16_CR5","first-page":"493","volume":"14","author":"KL Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. JMAA 14(3), 493\u2013498 (1966)","journal-title":"JMAA"},{"key":"16_CR6","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":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388\u2013404 (2012)","journal-title":"Transp. Sci."},{"issue":"2","key":"16_CR9","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":"16_CR10","doi-asserted-by":"crossref","unstructured":"Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding fastest paths on a road network with speed patterns. In: ICDE 2006, p.\u00a010. IEEE Computer Society (2006)","DOI":"10.1109\/ICDE.2006.71"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s00778-022-00758-w","volume":"32","author":"J Li","year":"2023","unstructured":"Li, J., Ni, C., He, D., Li, L., Xia, X., Zhou, X.: Efficient knn query for moving objects on time-dependent road networks. VLDB J. 32(3), 575\u2013594 (2023)","journal-title":"VLDB J."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Li, K., Chen, L., Shang, S.: Towards alleviating traffic congestion: optimal route planning for massive-scale trips. In: IJCAI 2020, pp. 3400\u20133406 (2020)","DOI":"10.24963\/ijcai.2020\/470"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Li, K., Chen, L., Shang, S., Kalnis, P., Yao, B.: Traffic congestion alleviation over dynamic road networks: continuous optimal route combination for trip query streams. In: IJCAI 2021, pp. 3656\u20133662 (2021)","DOI":"10.24963\/ijcai.2021\/503"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks. In: ICDE 2020, pp. 1189\u20131200. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: SIGMOD, pp. 709\u2013724. ACM (2018)","DOI":"10.1145\/3183713.3196913"},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/s00778-023-00789-x","volume":"32","author":"D Ouyang","year":"2023","unstructured":"Ouyang, D., Wen, D., Qin, L., Chang, L., Lin, X.: When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6), 1263\u20131287 (2023)","journal-title":"VLDB J."},{"key":"16_CR17","unstructured":"Samet, H.: Foundations of multidimensional and metric data structures. Elsevier\/Morgan Kaufmann (2006)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Thomsen, J.R., Yiu, M.L., Jensen, C.S.: Effective caching of shortest paths for location-based services. In: SIGMOD 2012, pp. 313\u2013324. ACM (2012)","DOI":"10.1145\/2213836.2213872"},{"issue":"11","key":"16_CR19","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.14778\/3342263.3342265","volume":"12","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Li, G., Tang, N.: Querying shortest paths on time dependent road networks. Proc. VLDB Endow. 12(11), 1249\u20131261 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Wilkie, D., van\u00a0den Berg, J.P., Lin, M.C., Manocha, D.: Self-aware traffic route planning. In: AAAI 2011, pp. 1521\u20131527. AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7984"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Xu, Y., Li, L., Zhang, M., Xu, Z., Zhou, X.: Global routing optimization in road networks. In: ICDE 2023, pp. 2524\u20132537. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00194"},{"issue":"11","key":"16_CR22","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks. In: ICDE 2021, pp. 336\u2013347. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00036"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-5572-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T23:06:23Z","timestamp":1725059183000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-5572-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819755714","9789819755721"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-5572-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gifu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"2 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2024a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dasfaa2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}