Multiple Routing Strategies in a Labelled Network
CERTU, Lyon, France.
2 ISIMA, Campus des Cézeaux, Université Blaise Pascal, BP. 125, 63173 Aubière, France.
Accepted: November 2000
We present here models and algorithms for the construction of efficient path systems, robust to possible variations of the characteristics of the network. We propose some interpretations of these models and proceed to numerical experimentations of the related algorithms. We conclude with a discussion of the way those concepts may be applied to the design of a Public Transportation System.
Key words: Shortest paths / network design / routing.
© EDP Sciences, 2001