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.


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


    Beteiligte:

    Erscheinungsdatum :

    14.03.1977


    Format / Umfang :

    3 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