Abstract
We consider shortest paths on a realistic multi-modal transportation network where restrictions or preferences on the use of certain modes of transportation or types of roads arise. The regular language constraint shortest path problem deals with this kind of problem. It models constraints by using regular languages. The problem can be solved efficiently by using a generalization of Dijkstra’s algorithm (D RegLC ). In this paper we present a new label correcting algorithm (lcSDALT) with a speed-up, in our setting, of a factor 3 to 30 in respect to (D RegLC ) and up to a factor 2 in respect to a similar algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barrett, C., Bisset, K., Holzer, M., Konjevod, G., Marathe, M., Wagner, D.: Engineering Label-Constrained Shortest-Path Algorithms. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 27–37. Springer, Heidelberg (2008)
Barrett, C., Bisset, K., Jacob, R., Konjevod, G., Marathe, M.V.: Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 126–138. Springer, Heidelberg (2002)
Barrett, C., Jacob, R., Marathe, M.: Formal-Language-Constrained Path Problems. SIAM Journal on Computing 30(3), 809 (2000)
Delling, D., Pajor, T., Wagner, D.: Accelerating Multi-modal Route Planning by Access-Nodes. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 587–598. Springer, Heidelberg (2009)
Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. Algorithmics of Large and Complex Networks 2, 117–139 (2009)
Delling, D., Wagner, D.: Time-Dependent Route Planning. Online 2, 207–230 (2009)
Dibbelt, J., Pajor, T., Wagner, D.: User-Constrained Multi-Modal Route Planning. In: Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX 2012). SIAM (2012)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)
Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 156–165. SIAM (2005)
Goldberg, A.V., Werneck, R.: Computing point-to-point shortest paths from external memory. US Patent App. 11/115,558 (2005)
Hart, P., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Ikeda, T., Imai, H., Nishimura, S., Shimoura, H., Hashimoto, T., Tenmoku, K., Mitoh, K.: A fast algorithm for finding better routes by AI search techniques. IEEE (1994)
Kaufman, D., Smith, R.: Fastest paths in time-dependent networks for intelligent vehicle-highway systems applications. Journal of Intelligent Transportation Systems 1(1), 1–11 (1993)
Kirchler, D., Liberti, L., Pajor, T., Wolfler Calvo, R.: UniALT for Regular Language Constrained Shortest Paths on a Multi-Modal Transportation Network. In: Kontogiannis, A.C., Spyros (eds.) 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, pp. 64–75. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2011)
Nannicini, G., Delling, D., Liberti, L., Schultes, D.: Bidirectional A search for time-dependent fast paths. Experimental Algorithms 2(2), 334–346 (2008)
Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics 12(2), 1–39 (2007)
Rice, M., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. In: Proceedings of the VLDB Endowment, pp. 69–80 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirchler, D., Liberti, L., Wolfler Calvo, R. (2012). A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network. In: Klasing, R. (eds) Experimental Algorithms. SEA 2012. Lecture Notes in Computer Science, vol 7276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30850-5_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-30850-5_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30849-9
Online ISBN: 978-3-642-30850-5
eBook Packages: Computer ScienceComputer Science (R0)