An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model
C. Gawron ()
Additional contact information
C. Gawron: Center for Parallel Computing, Cologne University, D-50931 Köln, Germany
International Journal of Modern Physics C (IJMPC), 1998, vol. 09, issue 03, 393-407
An iterative algorithm to determine the dynamic user equilibrium with respect to link costs defined by a traffic simulation model is presented. Each driver's route choice is modeled by a discrete probability distribution which is used to select a route in the simulation. After each simulation run, the probability distribution is adapted to minimize the travel costs. Although the algorithm does not depend on the simulation model, a queuing model is used for performance reasons. The stability of the algorithm is analyzed for a simple example network. As an application example, a dynamic version of Braess's paradox is studied.
Keywords: Traffic Simulation; Dynamic Traffic Assignment; Dynamic User Equilibrium; Braess's Paradox (search for similar items in EconPapers)
References: Add references at CitEc
Citations View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:09:y:1998:i:03:n:s0129183198000303
Ordering information: This journal article can be ordered from
Access Statistics for this article
International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann
More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().