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.
Publication date:
December 1, 1977
Publication type:
Journal Article
Citation:
Daganzo, C. F. (1977). On the Traffic Assignment Problem with Flow Dependent Costs—II. Transportation Research, 11(6), 439–441. https://doi.org/10.1016/0041-1647(77)90010-7