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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    On the traffic assignment problem with flow dependent costs—II


    Contributors:

    Publication date :

    1977-03-14


    Size :

    3 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Dynamic Traffic Assignment with Arrival Time Costs

    Janson, B. N. / Roble, J. | British Library Conference Proceedings | 1993


    Multiclass Traffic Assignment Problem with Flow-Dependent Passenger Car Equivalent Value of Trucks

    de Andrade, Gustavo Riente / Chen, Zhibin / Elefteriadou, Lily et al. | Transportation Research Record | 2017



    An equivalent optimization formulation for the traffic assignment problem with asymmetric linear costs

    Grange, Louis de / Muñoz, Juan Carlos | Taylor & Francis Verlag | 2009