In stochastic (dynamic) traffic assignment (DTA), route choice (RC) formulations with implicit set require less memory than their explicit counterparts. To compute turn probabilities, however, a topological ordering of the nodes is needed, which negatively impacts stability convergence and consistency equilibrium. This paper formulates general framework for RC module efficient DTA (ESDTA) witho...

The management of severe congestion in complex urban networks calls for dynamic traffic assignment (DTA) models that can replicate real traffic situations with long queues and spillbacks. DynaMIT-P, a mesoscopic traffic simulation system, was enhanced and calibrated to capture the traffic characteristics in the city of Beijing, China. All demand and supply parameters were calibrated simultaneou...

The network travel time pattern plays a double role in within-day dynamic traffic assignment: on one side, it constitutes the main attribute in the context of users’ path choice; on the other side, it determines the arc flow pattern for given path choices. Then, it is important that in the supply model realistic arc performances are yielded for given arc inflows. On the other hand, the arc perf...

This paper considers the problem of dynamic traffic assignment under the principle that individual drivers will choose fastest paths, in the dynamic situation where path durations consist of time-dependent link travel times. Rather than constructing a unified model encompassing traffic dynamics and route choice, we decompose the model into an assignment mapping, which identifies the link travel...