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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    On the traffic assignment problem with flow dependent costs—I


    Beteiligte:

    Erscheinungsdatum :

    01.03.1977


    Format / Umfang :

    5 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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