Abstract This note generalizes the results obtained by Daganzo (1977) in a previous paper by showing how to incorporate link capacities into any equilibrium traffic assignment algorithm. This is done by defining an equivalent uncapacitated traffic equilibrium problem (EP). As an example it is shown how Nguyen's algorithm (Nguyen, 1974) can be easily modified to deal with capacitated networks.
On the traffic assignment problem with flow dependent costs—II
1977-03-14
3 pages
Article (Journal)
Electronic Resource
English
On the traffic assignment problem with flow dependent costs—I
Elsevier | 1977
|Dynamic Traffic Assignment with Arrival Time Costs
British Library Conference Proceedings | 1993
|Multiclass Traffic Assignment Problem with Flow-Dependent Passenger Car Equivalent Value of Trucks
Transportation Research Record | 2017
|Taylor & Francis Verlag | 2009
|