UniALT for regular language constrained shortest paths on a multi-modal transportation network

OpenAccess Series in Informatics

Volumn 20, Issue , 2011, Pages 64-75

  Kirchler, Dominik ^a,b,c   Liberti, Leo ^a   Pajor, Thomas ^d   Calvo, Roberto Wolfler ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITÉ PARIS 13   (France)

^c Mediamobile   (France)

^d KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

ALT; Multi modal; Regular language; Shortest path; Time dependency

Indexed keywords

ALT; CONSTRAINED SHORTEST PATH; MULTI-MODAL; PUBLIC TRANSPORTATION; PUBLIC TRANSPORTATION NETWORKS; SHORTEST PATH; TIME-DEPENDENCY; TRANSPORTATION NETWORK;

FORMAL LANGUAGES; GRAPH THEORY; MULTIMODAL TRANSPORTATION; OPTIMIZATION; TRANSPORTATION ROUTES;

ALGORITHMS;

EID: 84873714040     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2011.64     Document Type: Conference Paper

References (23)

1. Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe, and Dorothea Wagner. Engineering label-constrained shortest-path algorithms. Algorithmic Aspects in Information and Management, pages 27-37, 2008.
2. Chris Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, and M. V. Marath. Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router. Proc. ESA, pages 126-138, 2002.
3. Chris Barrett, Riko Jacob, and Madhav Marathe. Formal-Language- Constrained Path Problems. SIAM Journal on Computing, 30(3):809, 2000.
4. Daniel Delling and Giacomo Nannicini. Bidirectional core-based routing in dynamic time-dependent road networks. Algorithms and Computation, 0(2):812-823, 2008.
5. Daniel Delling, Thomas Pajor, and Dorothea Wagner. Accelerating Multi-Modal Route Planning by Access-Nodes. Algorithms-ESA 2009, 2, 2009.
6. Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. Engineering route planning algorithms. Algorithmics of large and complex networks, 2:117-139, 2009.
7. Daniel Delling and Dorothea Wagner. Time-Dependent Route Planning. Online, 2, 2009.
8. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1(1):269-271, 1959.
9. Andrew V Goldberg and C. Harrelson. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th annual ACM-SIAM Sym. on Discrete algorithms, 2005.
10. Andrew V Goldberg and R Werneck. Computing point-to-point shortest paths from external memory. US Patent App. 11/115,558, 2005.
11. Peter Hart, Nils Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Min. Cost Paths. IEEE Trans. on Sys. Science and Cybern., 4(2), 1968.
12. T. Ikeda, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and K. Mitoh. A fast algorithm for finding better routes by AI search techniques. IEEE, 1994.
13. David Kaufman and Robert Smith. Fastest paths in time-dependent networks for intelligent vehicle-highway systems applications. Journal of Intelligent Transportation Systems, 1(1):1-11, 1993.
14. Angelica Lozano and Giovanni Storchi. Shortest viable path algorithm in multimodal networks. Transportation Research Part A: Policy and Practice, 35(3):225-241, 1999.
15. Alberto O. Mendelzon and Peter T. Wood. Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing, 24(6):1235, 1995.
16. * search for time-dependent fast paths. Experimental Algorithms, 2(2):334-346, 2008.
17. Giacomo Nannicini and Leo Liberti. Shortest paths on dynamic graphs. International Transactions in Operational Research, 15(5):551-563, 2008.
18. Ariel Orda and Raphael Rom. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3):607-625, 1990.
19. Thomas Pajor. Multi-Modal Route Planning. Master thesis, Univ. Karlsruhe (TH), 2009.
20. Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis. Efficient models for timetable information in public transportation systems. Journal of Experimental Algorithmics, 12(2):1-39, 2007.
21. J.F. Romeuf. Shortest path under rational constraint. Information processing letters, 28(5):245-248, 1988.
22. Hanif Sherali, Antoine Hobeika, and Sasikul Kangwalklai. Time-Dependent, Label-Constrained Shortest Path Problems with Applications. Transp. Science, 37(3), 2003.
23. Mihalis Yannakakis. Graph-theoretic methods in database theory. ACM Press, 1990.