Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
C. Gawron (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: