Are the objective and solutions of dynamic user-equilibrium models always consistent?

2000 ◽  
Vol 34 (2) ◽  
pp. 137-144 ◽  
Author(s):  
Wei-Hua Lin ◽  
Hong K Lo
1998 ◽  
Vol 09 (03) ◽  
pp. 393-407 ◽  
Author(s):  
C. Gawron

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.


Sign in / Sign up

Export Citation Format

Share Document