{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T11:26:17Z","timestamp":1746789977607,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030953874"},{"type":"electronic","value":"9783030953881"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95388-1_2","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:20:55Z","timestamp":1645518055000},"page":"18-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Estimation of\u00a0Time-Dependent Shortest Paths Based on\u00a0Shortcuts"],"prefix":"10.1007","author":[{"given":"Linbo","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shipeng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongxuan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhua","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"101819","DOI":"10.1016\/j.tre.2019.11.013","volume":"133","author":"BY Chen","year":"2020","unstructured":"Chen, B.Y., Chen, X.W., Chen, H.P., Lam, W.H.K., Talley, W.: Efficient algorithm for finding k shortest paths based on re-optimization technique. Transp. Res. Part E Logs Transp. Rev. 133, 101819 (2020)","journal-title":"Transp. Res. Part E Logs Transp. Rev."},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/ijoc.10.2.163","volume":"10","author":"YL Chou","year":"1998","unstructured":"Chou, Y.L., Romeijn, H.E., Smith, R.L.: Approximating shortest paths in large-scale networks with an application to intelligent transportation systems. Inf. J. Comput. 10(2), 163\u2013179 (1998)","journal-title":"Inf. J. Comput."},{"issue":"2","key":"2_CR3","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":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117\u2013139. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02094-0_7"},{"key":"2_CR5","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. Numerische Mathematik 1, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"SE Dreyfus","year":"1967","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Oper. Res. 17(3), 395\u2013412 (1967)","journal-title":"Oper. Res."},{"issue":"3","key":"2_CR7","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."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: efficient point-to-point shortest path algorithms. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments, pp. 129\u2013143. Society for Industrial and Applied Mathematics, USA (2006)","DOI":"10.1137\/1.9781611972863.13"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-72845-0_4","volume-title":"Experimental Algorithms","author":"AV Goldberg","year":"2007","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Better landmarks within reach. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 38\u201351. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72845-0_4"},{"key":"2_CR10","unstructured":"Gonzalez, H., Han, J., Li, X., Myslinska, M., Sondag, J.P.: Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB \u201907, VLDB Endowment, pp. 794\u2013805 (2007)"},{"key":"2_CR11","unstructured":"Gutman, R.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks, pp. 100\u2013111 (2004)"},{"issue":"2","key":"2_CR12","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":"2_CR13","unstructured":"Lai, Y., Yang, S., Xiong, A., Yang, F., Li, L., Zhou, X.: Utility-based matching of vehicles and hybrid requests on rider demand responsive systems. IEEE Trans. Intell. Transp. Syst., 1\u201315 (2020)"},{"key":"2_CR14","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilit\u00e4t - von der Forschung zur praktischen Anwendung (2004)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Lauther, U.: An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags. In: DIMACS Book, vol. 74 (2009)","DOI":"10.1090\/dimacs\/074\/02"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/3231541.3231545","volume":"10","author":"L Li","year":"2018","unstructured":"Li, L., Kim, J., Xu, J., Zhou, X.: Time-dependent route scheduling on road networks. SIGSPATIAL Spec. 10(1), 10\u201314 (2018)","journal-title":"SIGSPATIAL Spec."},{"key":"2_CR17","unstructured":"Macqueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability 1967 (1967)"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11427186_18","volume-title":"Experimental and Efficient Algorithms","author":"RH M\u00f6hring","year":"2005","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra\u2019s algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 189\u2013202. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11427186_18"},{"issue":"7","key":"2_CR19","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1002\/net.3230220707","volume":"22","author":"J Shapiro","year":"2010","unstructured":"Shapiro, J., Waxman, J., Nir, D.: Level graphs and approximate shortest path algorithms. Networks 22(7), 691\u2013717 (2010)","journal-title":"Networks"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 776\u2013787. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_69"},{"issue":"11","key":"2_CR21","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 Endowment 12(11), 1249\u20131261 (2019)","journal-title":"Proc. VLDB Endowment"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s00778-017-0457-6","volume":"26","author":"D Zhang","year":"2017","unstructured":"Zhang, D., Yang, D., Wang, Y., Tan, K.-L., Cao, J., Shen, H.T.: Distributed shortest path query processing on dynamic road networks. VLDB J. 26(3), 399\u2013419 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0457-6","journal-title":"VLDB J."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95388-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T08:27:54Z","timestamp":1645518474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95388-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953874","9783030953881"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95388-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"403","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"145","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.12","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}