A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
In stochastic (dynamic) traffic assignment (DTA), route choice (RC) formulations with implicit route set require less memory than their explicit counterparts. To compute turn probabilities, however, a topological ordering of the nodes is needed, which negatively impacts the stability of convergence and consistency of equilibrium. This paper formulates a general framework for the RC module of the efficient stochastic DTA (ESDTA) without topological ordering; we demonstrate how its full fixed route yields smooth and consistent convergence. The theoretical framework requires a series of computational modifications to ensure that numerical errors remain limited and to make the formulation more efficient for use in practice. The resulting ESDTA's computation time to reach equilibrium scales linearly with respect to all relevant complexity dimensions (network size, demand zones, time resolution, and congestion level).
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
In stochastic (dynamic) traffic assignment (DTA), route choice (RC) formulations with implicit route set require less memory than their explicit counterparts. To compute turn probabilities, however, a topological ordering of the nodes is needed, which negatively impacts the stability of convergence and consistency of equilibrium. This paper formulates a general framework for the RC module of the efficient stochastic DTA (ESDTA) without topological ordering; we demonstrate how its full fixed route yields smooth and consistent convergence. The theoretical framework requires a series of computational modifications to ensure that numerical errors remain limited and to make the formulation more efficient for use in practice. The resulting ESDTA's computation time to reach equilibrium scales linearly with respect to all relevant complexity dimensions (network size, demand zones, time resolution, and congestion level).
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
Verstraete, Jeroen (author) / Tampère, Chris M. J. (author)
Computer‐Aided Civil and Infrastructure Engineering ; 37 ; 1223-1242
2022-08-01
20 pages
Article (Journal)
Electronic Resource
English
Hybrid Route Choice Modeling in Dynamic Traffic Assignment
| British Library Online Contents | 2009
Stochastic and deterministic formulations of dynamic traffic assignment
| British Library Conference Proceedings | 1997
Dynamic Network Traffic Assignment and Route Guidance Via Feedback Regulation
| British Library Online Contents | 1991
POLICY-BASED STOCHASTIC DYNAMIC TRAFFIC ASSIGNMENT MODELS AND ALGORITHMS
| British Library Conference Proceedings | 2002