Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks

Authors:
Giacomo Nannicini;Philippe Baptiste;Daniel Krob;Leo Liberti
Affiliations:
LIX, École Polytechnique, Palaiseau, France F-91128 and Mediamobile, Paris, France;LIX, École Polytechnique, Palaiseau, France F-91128;LIX, École Polytechnique, Palaiseau, France F-91128;LIX, École Polytechnique, Palaiseau, France F-91128
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 5
Cited 2

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)
Speed-up techniques for shortest-path computations

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Engineering fast route planning algorithms

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Goal directed shortest path queries using precomputed cluster distances

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms

Efficient best path monitoring in road networks for instant local traffic information

ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for the point-to-point time-dependent shortest path problem, using which good solutions may be found in a short time; our method provides an upper bound to the number of settled nodes for each shortest path computation, which is highly desirable in some industrial applications. In particular, we address a typical server scenario, where we have to compute point-to-point shortest paths in road networks where arc costs (travelling times) are time-dependent, and where each request has to be provided within an allotted time frame.