Abstract We consider a network with interactions and capacity constraints at each junction. We give conditions on the interactions and constraints which, if satisfied at each separate junction, ensure that any feasible assignment problem has an equilibrium solution. Two illustrative examples are provided; the first arises naturally and does not satisfy our conditions, while the second does satisfy our conditions but is somewhat unnatural.
The existence of an equilibrium solution to the traffic assignment problem when there are junction interactions
Transportation Research Part B: Methodological ; 15 , 6 ; 443-451
1980-12-02
9 pages
Article (Journal)
Electronic Resource
English
Junction interactions and monotonicity in traffic assignment
Elsevier | 1980
|Reduced gradient algorithm for user equilibrium traffic assignment problem
Taylor & Francis Verlag | 2020
|Traffic : an equilibrium traffic assignment program
TIBKAT | 1978
|Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem
Transportation Research Record | 2013
|A Distributed Algorithm for the Dynamic Traffic Equilibrium Assignment Problem
British Library Conference Proceedings | 1996
|