A Globalized Robust Optimization Approach of Dynamic Network Design Problem With Demand Uncertainty

被引:4
作者
Zhao, Fangwei [1 ]
Sun, Hua [2 ]
Zhao, Fangxia [3 ]
Zhang, Hong [1 ]
Li, Tongfei [4 ]
机构
[1] China Acad Railway Sci Corp Ltd, Met & Chem Res Inst, Beijing 100081, Peoples R China
[2] Gome Share Beijing Network Technol Corp Ltd, Beijing 100016, Peoples R China
[3] China Acad Railway Sci Corp Ltd, Inst Comp Technol, Beijing 100081, Peoples R China
[4] Beijing Univ Technol, Beijing Key Lab Traff Engn, Beijing 100124, Peoples R China
关键词
Cell transmission model; demand uncertainty; globalized robust optimization; network design problem; non-holding back; CELL TRANSMISSION MODEL; TRAFFIC ASSIGNMENT; PROGRAMMING-PROBLEMS; SYSTEM;
D O I
10.1109/ACCESS.2019.2933540
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a globalized robust optimization approach for a network design problem explicit incorporating traffic dynamics and demand uncertainty. In particular, a non-holding back cell transmission model (CTM) based network design problem of linear programming type is considered to describe dynamic traffic flows, and the normal range of the uncertain demand is assumed to be a box set, i.e., the uncertain demand outside box set is allowed. The major contribution of this paper is to formulate such a globalized robust network design problem as a tractable linear programming model and demonstrate the model robustness and flexibility by comparing its solution performance with the robust solution from the usual robust model and the adjustable robust solution from the adjustable robust model, respectively. A numerical experiment is conducted to demonstrate that the modeling advantage of the globalized robust optimization in terms of solution quality. The proposed globalized robust optimization approach may provide useful insights and have broader applicability in traffic management and traffic planning problems under uncertainty.
引用
收藏
页码:115734 / 115748
页数:15
相关论文
共 60 条
[11]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[12]   The Continuous-Time Service Network Design Problem [J].
Boland, Natashia ;
Hewitt, Mike ;
Marshall, Luke ;
Savelsbergh, Martin .
OPERATIONS RESEARCH, 2017, 65 (05) :1303-1321
[13]  
Brooke A., 1992, GAMS: A Users Guide
[14]   On strategic multistage operational two-stage stochastic 0-1 optimization for the Rapid Transit Network Design problem [J].
Cadarso, Luis ;
Escudero, Laureano F. ;
Marin, Angel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (02) :577-593
[16]  
Chung BD, 2011, NETW SPAT ECON, V11, P371
[17]   Dynamic congestion pricing with demand uncertainty: A robust optimization approach [J].
Chung, Byung Do ;
Yao, Tao ;
Friesz, Terry L. ;
Liu, Hongcheng .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2012, 46 (10) :1504-1518
[18]   Dynamic Traffic Assignment under Uncertainty: A Distributional Robust Chance-Constrained Approach [J].
Chung, Byung Do ;
Yao, Tao ;
Zhang, Bo .
NETWORKS & SPATIAL ECONOMICS, 2012, 12 (01) :167-181
[19]   THE CELL TRANSMISSION MODEL - A DYNAMIC REPRESENTATION OF HIGHWAY TRAFFIC CONSISTENT WITH THE HYDRODYNAMIC THEORY [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1994, 28 (04) :269-287
[20]   THE CELL TRANSMISSION MODEL .2. NETWORK TRAFFIC [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1995, 29 (02) :79-93