Abstract In a recent paper LeBlanc et al. presented an efficient mathematical algorithm to solve the multicommodity user-equilibrated network flow distribution problem with flow dependent costs. This paper shows how to generalize the algorithm to networks with link capacities and illustrates the modification with a simple numerical example.
On the traffic assignment problem with flow dependent costs—I
1977-03-01
5 pages
Article (Journal)
Electronic Resource
English
On the traffic assignment problem with flow dependent costs—II
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
|