Abstract We consider a network with interactions and capacity constraints at each junction. We give conditions on the interactions and constraints which, if satisfied at each separate junction, ensure that any feasible assignment problem has an equilibrium solution. Two illustrative examples are provided; the first arises naturally and does not satisfy our conditions, while the second does satisfy our conditions but is somewhat unnatural.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The existence of an equilibrium solution to the traffic assignment problem when there are junction interactions


    Contributors:
    Smith, M.J. (author)

    Published in:

    Publication date :

    1980-12-02


    Size :

    9 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Reduced gradient algorithm for user equilibrium traffic assignment problem

    Babazadeh, Abbas / Javani, Babak / Gentile, Guido et al. | Taylor & Francis Verlag | 2020


    Traffic : an equilibrium traffic assignment program

    Nguyen, Sang / James, Linda | TIBKAT | 1978


    Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem

    Wu, Xing / Nie, Yu (Marco) | Transportation Research Record | 2013


    A Distributed Algorithm for the Dynamic Traffic Equilibrium Assignment Problem

    Wisten, M. B. / Smith, M. J. | British Library Conference Proceedings | 1996