A within-day dynamic traffic assignment model for urban road networks (original) (raw)

In this paper a new formulation of within-day dynamic traffic assignment is presented, where dynamic user equilibrium is expressed as a fixed point problem in terms of arc flow temporal profiles. Specifically, it is shown that, by extending to the dynamic case the concept of Network Loading Map, is no more needed to introduce a Dynamic Network Loading in order to ensure the temporal consistency of the supply model. On this basis it is possible to devise efficient assignment algorithms, whose complexity is equal to the one resulting in the static case multiplied by the number of time intervals in which the period of analysis is divided. With specific reference to a Logit path choice model, an implicit path enumeration network loading procedure is obtained as an extension of Dial's algorithm; then, the fixed point problem is solved through the Bather's method.