In dynamic traffic assignment (DTA) models, it seems relevant to consider the uncertainty inherent to motorist route choices. Particularly, choices on realistic transport networks are mostly made using motorists' perceived costs of all routes from their origins to their destinations. We present an approach to address stochastic DTA based on nested cost operators, where motorists choose according to the perceived costs of the remaining trip, namely, from current position to destination. We integrate the Markovian traffic equilibrium by Baillon and Cominetti with the DTA formulation by Addison and Heydecker obtaining an arc-based stochastic DTA model, which we denote in short as ABSDTA. The resulting approach accommodates overlapping routes, respecting costs' correlation as well as the first-in-first-out rule. We present a solution method for discrete time periods, computational results on an illustrative network, including sensitivity analyses of the parameters, and comparisons with a previous suitable stochastic DTA model from the literature.
An arc-based approach for stochastic dynamic traffic assignment
TRANSPORTMETRICA B
R. DE LA PAZ GUALA ET AL.
31.12.2024
31 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
POLICY-BASED STOCHASTIC DYNAMIC TRAFFIC ASSIGNMENT MODELS AND ALGORITHMS
British Library Conference Proceedings | 2002
|Stochastic and deterministic formulations of dynamic traffic assignment
British Library Conference Proceedings | 1997
|Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator
Online Contents | 2006
|Stochastic Heuristic Dynamic Assignment Based on AIMSUN Microscopic Traffic Simulator
Transportation Research Record | 2006
|