Learn More
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 modelled 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(More)
We discuss topics related to the notion of shortest paths in large street networks. In a rst section we discuss the dynamic traac assignment problem and describe an algorithm designed to determine user equilibria in simulation-based traac models. The proposed algorithm is able to nd in a reasonable amount of time equilibria in problems that are not(More)
  • 1