AbstractThis paper is concerned with the system optimum-dynamic traffic assignment (SO-DTA) problem when the time-dependent demands are random variables with known probability distributions. The model is a stochastic extension of a deterministic linear programming formulation for SO-DTA introduced by Ziliaskopoulos (Ziliaskopoulos, A.K., 2000. A linear programming model for the single destination system optimum dynamic traffic assignment problem, Transportation Science, 34, 1–12). The proposed formulation is chance-constrained based and we demonstrate that it provides a robust SO solution with a user specified level of reliability. The model provides numerous insights and can be a useful tool in producing robust control and management strategies that account for uncertainty in applications where SO-DTA is relevant (e.g. evacuation modeling, computing alternate routes around freeway incidents and establishing lower bounds on network performance).
A chance-constrained based stochastic dynamic traffic assignment model: Analysis, formulation and solution algorithms
Tramsportation Research, Part C: Emerging Technologies ; 14 , 6 ; 418-427
2006-01-01
10 pages
Article (Journal)
Electronic Resource
English
Robust traffic assignment model: Formulation, solution algorithms and empirical application
Taylor & Francis Verlag | 2017
|POLICY-BASED STOCHASTIC DYNAMIC TRAFFIC ASSIGNMENT MODELS AND ALGORITHMS
British Library Conference Proceedings | 2002
|Formulation and Solution Algorithm for Fuzzy Dynamic Traffic Assignment Model
Online Contents | 2003
|