Abstract A network optimization problem is formulated which yields a probabilistic equilibrated traffic assignment incorporating congestion effects and which as a special case, reduces to a user optimized equilibrium solution. In the resulting model, path choice is determined by a logit formula in which path costs are functions of the assigned flows. The article also demonstrates the similarity between some fixed demand incremental methods of traffic assignment and the minimization problem associated with computing the user equilibrium assignment.
Some developments in equilibrium traffic assignment
Transportation Research Part B: Methodological ; 14 , 3 ; 243-255
1979-06-30
13 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Traffic : an equilibrium traffic assignment program
TIBKAT | 1978
|Parallel dynamic traffic equilibrium assignment
Online Contents | 1993
|A dynamic traffic equilibrium assignment paradox
Online Contents | 2000
|Analysis of Traffic Models for Dynamic Equilibrium Traffic Assignment
British Library Conference Proceedings | 1998
|