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

Shortest paths on road networks can be efficiently calculated using Dijkstra's algorithm (D). In addition to roads, multi-modal transportation networks include public transportation, bicycle lanes, etc. For paths on this type of network, further constraints, e.g., preferences in using certain modes of transportation, may arise. The regular language constrained shortest path problem deals with this kind of problem. It uses a regular language to model the constraints. The problem can be solved efficiently by using a generalization of Dijkstra's algorithm (D_RegLC). In this paper we propose an adaption of the speed-up technique uniALT, in order to accelerate D_RegLC. We call our algorithm SDALT. We provide experimental results on a realistic multi-modal public transportation network including time-dependent cost functions on arcs. The experiments show that our algorithm performs well, with speed-ups of a factor 2 to 20.

[1]  Jean-François Romeuf.  Shortest Path Under Rational Constraint , 1988, Inf. Process. Lett..

[2]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..

[3]  Dorothea Wagner,et al.  Accelerating Multi-modal Route Planning by Access-Nodes , 2009, ESA.

[4]  Andrew V. Goldberg,et al.  Computing Point-to-Point Shortest Paths from External Memory , 2005, ALENEX/ANALCO.

[5]  Madhav V. Marathe,et al.  Engineering Label-Constrained Shortest-Path Algorithms , 2008, The Shortest Path Problem.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[8]  Leo Liberti,et al.  Shortest paths on dynamic graphs , 2008, Int. Trans. Oper. Res..

[9]  Leo Liberti,et al.  Bidirectional A* Search for Time-Dependent Fast Paths , 2008, WEA.

[10]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[11]  Manuel Braun.  Multi-Modal Route Planning with Transfer Patterns , 2012 .

[12]  Christos D. Zaroliagis,et al.  Efficient models for timetable information in public transportation systems , 2008, JEAL.

[13]  Peter Sanders,et al.  Engineering Route Planning Algorithms , 2009, Algorithmics of Large and Complex Networks.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Hiroshi Imai,et al.  A fast algorithm for finding better routes by AI search techniques , 1994, Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference.

[16]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[17]  Giovanni Storchi,et al.  Shortest viable path algorithm in multimodal networks , 2001 .

[18]  Madhav V. Marathe,et al.  Formal Language Constrained Path Problems , 1998, SWAT.

[19]  Dorothea Wagner,et al.  Time-Dependent Route Planning , 2009, Encyclopedia of GIS.

[20]  Giacomo Nannicini,et al.  Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks , 2008, ISAAC.

[21]  Hanif D. Sherali,et al.  Time-Dependent, Label-Constrained Shortest Path Problems with Applications , 2003, Transp. Sci..

[22]  Andrew V. Goldberg,et al.  Computing the shortest path: A search meets graph theory , 2005, SODA '05.

[23]  Madhav V. Marathe,et al.  Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router , 2002, ESA.