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.


    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—I


    Contributors:

    Publication date :

    1977-03-01


    Size :

    5 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