An iterative algorithm to determine the dynamic user equilibrium in a traffic simulation model

摘要

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. [References: 15]