Volume 35, Number 1, January March 2001
|Page(s)||85 - 106|
|Published online||15 August 2002|
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
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.