Abstract A network optimization problem is formulated which yields a probabilistic equilibrated traffic assignment incorporating congestion effects and which as a special case, reduces to a user optimized equilibrium solution. In the resulting model, path choice is determined by a logit formula in which path costs are functions of the assigned flows. The article also demonstrates the similarity between some fixed demand incremental methods of traffic assignment and the minimization problem associated with computing the user equilibrium assignment.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Some developments in equilibrium traffic assignment


    Beteiligte:
    Fisk, Caroline (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    30.06.1979


    Format / Umfang :

    13 pages




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Equilibrium assignment algorithms : comparison of some algorithms for equilibrium traffic assignment with fixed demands

    Arezki, Y. / University of Leeds, Institute for Transport Studies | TIBKAT | 1986


    Traffic : an equilibrium traffic assignment program

    Nguyen, Sang / James, Linda | TIBKAT | 1978


    Parallel dynamic traffic equilibrium assignment

    Smith, M.J. | Online Contents | 1993


    A dynamic traffic equilibrium assignment paradox

    Akamatsu, Takashi | Online Contents | 2000


    Dynamic Equilibrium Assignment with Microscopic Traffic Simulation

    Liu, H. X. / Ma, W. / Ban, J. X. et al. | British Library Conference Proceedings | 2005