Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks

Sébastien Felix (1, 2) , Jérôme Galtier (2)

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
2 Orange Labs [Sophia Antipolis]

In this paper, we focus on time-dependent graphs which seem to be a good way to model transport Networks. In the first part, we remind some notations and techniques related to time-dependent graphs. In the second one, we introduce new algorithms to take into account the notion of probability related to paths in order to guarantee travelling times with a certain accuracy. We also discuss different probabilistic models and show the links between them.

Mots clés: Shortest Path; Approximation Algorithm; Probability; Graph Theory; Transport Networks

Domaines: Optimisation et contrôle [math.OC]

Sébastien Felix, Jérôme Galtier. Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks. 11th International Conference on ITS Telecommunications, Aug 2011, Saint-Petersburg, Russia. pp.56. ⟨hal-00659437⟩