Abstract We consider a bicriterion traffic assignment model where the network users have different values of time. We present an infinite-dimensional formulation of this model that lends itself to an extremely simple and efficient algorithm that takes into account the network structure of the problem.
An Efficient Algorithm for a Bicriterion Traffic Assignment Problem
01.01.1996
11 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
An Efficient Algorithm for a Bicriterion Traffic Assignment Problem
British Library Conference Proceedings | 1996
|Bicriterion traffic assignment: Efficient algorithms plus examples
Online Contents | 1997
|Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
Online Contents | 1996
|Bicriterion Traffic Assignment: Basic Theory and Elementary Algorithms
British Library Online Contents | 1996
|