Abstract:
K-Best Routing Strategies in a Labelled Graph: Application to the Design of a Public Transportation Network
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.