Abstract
We propose an algorithm for the point-to-point time-dependent shortest path problem, using which good solutions may be found in a short time; our method provides an upper bound to the number of settled nodes for each shortest path computation, which is highly desirable in some industrial applications. In particular, we address a typical server scenario, where we have to compute point-to-point shortest paths in road networks where arc costs (travelling times) are time-dependent, and where each request has to be provided within an allotted time frame.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Dreyfus, S.: An appraisal of some shortest-path algorithms. Operations Research 17(3), 395–412 (1969)
Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. Journal of Intelligent Transportation Systems 1(1), 1–11 (1993)
Orda, A., Rom, R.: Shortest-path and minimum delay algorithms in networks with time-dependent edge-length. Journal of the ACM 37(3), 607–625 (1990)
Goldberg, A., Kaplan, H., Werneck, R.: Reach for A ∗ : Efficient point-to-point shortest path algorithms. In: Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX 2006). LNCS, pp. 129–143. Springer, Heidelberg (2006)
Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: [11], pp. 23–36
Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: [11], pp. 52–65
Maue, J., Sanders, P., Matijevic, D.: Goal directed shortest path queries using precomputed cluster distances. In: Alvarez, C., Serna, M.J. (eds.) WEA 2006. LNCS, vol. 4007, pp. 316–327. Springer, Heidelberg (2006)
Nannicini, G., Baptiste, P., Krob, D., Liberti, L.: Fast paths in dynamic road networks. In: Quillot, A., Mahey, P. (eds.) Proceedings of ROADEF 2008, Clermont-Ferrand, Université Blaise Pascal (2008)
Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 23–36. Springer, Heidelberg (2007)
Demetrescu, C. (ed.): WEA 2007. LNCS, vol. 4525. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nannicini, G., Baptiste, P., Krob, D., Liberti, L. (2008). Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)