Abstract The paper considers the assignment problem when there are junction interactions. We give an objective function which measures the extent to which a traffic distribution departs from equilibrium, and an algorithm which (under certain conditions) calculates equilibria by steadily reducing the objective function to zero. It is shown that the algorithm certainly works if the network cost-flow function is monotone and continuously differentiable, and a boundary condition is satisfied.
The existence and calculation of traffic equilibria
Transportation Research Part B: Methodological ; 17 , 4 ; 291-303
12.11.1982
13 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
The existence, uniqueness and stability of traffic equilibria
Elsevier | 1979
|A Simulation Analysis on the Existence of Network Traffic Flow Equilibria
Online Contents | 2014
|British Library Conference Proceedings | 1992
|