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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Some developments in equilibrium traffic assignment


    Contributors:

    Published in:

    Publication date :

    1979-06-30


    Size :

    13 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    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


    Analysis of Traffic Models for Dynamic Equilibrium Traffic Assignment

    Heydecker, B. G. / Addison, J. D. / Association of European Operational Research Societies | British Library Conference Proceedings | 1998


    Dynamic equilibrium assignment with microscopic traffic simulation

    Liu, H.X. / Wenteng Ma, / Ban, J.X. et al. | IEEE | 2005