A label correcting algorithm for the shortest path problem on a multi-modal route network

Authors:
Dominik Kirchler;Leo Liberti;Roberto Wolfler Calvo
Affiliations:
LIX, Ecole Polytechnique, France,LIPN, Université Paris 13, France,Mediamobile, France;LIX, Ecole Polytechnique, France;LIPN, Université Paris 13, France
Venue:
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Year:
2012

Citing 9
Cited 0

Formal-Language-Constrained Path Problems

SIAM Journal on Computing
Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing the shortest path: A search meets graph theory

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient models for timetable information in public transportation systems

Journal of Experimental Algorithmics (JEA)
Engineering Label-Constrained Shortest-Path Algorithms

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Engineering Route Planning Algorithms

Algorithmics of Large and Complex Networks
Time-Dependent Route Planning

Robust and Online Large-Scale Optimization
Bidirectional A* search for time-dependent fast paths

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Graph indexing of road networks for shortest path queries with label restrictions

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

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 (DRegLC). 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 (DRegLC) and up to a factor 2 in respect to a similar algorithm.