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

Dominik Kirchler, Leo Liberti, Thomas Pajor & Roberto Wolfler Calvo
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...