.png){kind=icon}
.png){kind=icon}
Return
Consistent iterative algorithm for stochastic dynamic traffic assignment with a stable route set
.png){kind=icon}
OA
AI
DOI：10.1111/mice.12781.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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).
Keywords:
CHOICE
MODEL
NETWORK
GENERATION
Journal
C
IF:
9.1
Papers:
2.0K
Citations:
10.0K