A Distributionally Robust Optimization Method for Passenger Flow Control Strategy and Train Scheduling on an Urban Rail Transit Line

被引:38
作者
Lu, Yahan [1 ]
Yang, Lixing [1 ]
Yang, Kai [1 ]
Gao, Ziyou [1 ]
Zhou, Housheng [1 ]
Meng, Fanting [1 ]
Qi, Jianguo [1 ]
机构
[1] Beijing Jiaotong Univ, State Key Lab Rail Traff Control & Safety, Beijing 100044, Peoples R China
来源
ENGINEERING | 2022年 / 12卷
基金
中国国家自然科学基金;
关键词
Passenger flow control; Train scheduling; Distributionally robust optimization; Stochastic and dynamic passenger demand; Ambiguity set; TIME-DEPENDENT DEMAND; OVERSATURATED METRO LINE; FORMULATIONS; ALGORITHM; NETWORK; COORDINATION; TIMETABLES; MODELS;
D O I
10.1016/j.eng.2021.09.016
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Regular coronavirus disease 2019 (COVID-19) epidemic prevention and control have raised new requirements that necessitate operation-strategy innovation in urban rail transit. To alleviate increasingly serious congestion and further reduce the risk of cross-infection, a novel two-stage distributionally robust optimization (DRO) model is explicitly constructed, in which the probability distribution of stochastic scenarios is only partially known in advance. In the proposed model, the mean-conditional value-at-risk (CVaR) criterion is employed to obtain a tradeoff between the expected number of waiting passengers and the risk of congestion on an urban rail transit line. The relationship between the proposed DRO model and the traditional two-stage stochastic programming (SP) model is also depicted. Furthermore, to overcome the obstacle of model solvability resulting from imprecise probability distributions, a discrepancy-based ambiguity set is used to transform the robust counterpart into its computationally tractable form. A hybrid algorithm that combines a local search algorithm with a mixed-integer linear programming (MILP) solver is developed to improve the computational efficiency of large-scale instances. Finally, a series of numerical examples with real-world operation data are executed to validate the proposed approaches. (C) 2021 THE AUTHORS. Published by Elsevier LTD on behalf of Chinese Academy of Engineering and Higher Education Press Limited Company.
引用
收藏
页码:202 / 220
页数:19
相关论文
共 50 条
[1]   Exact formulations and algorithm for the train timetabling problem with dynamic demand [J].
Barrena, Eva ;
Canca, David ;
Coelho, Leandro C. ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2014, 44 :66-74
[2]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[3]   Robust optimization models for integrated train stop planning and timetabling with passenger demand uncertainty [J].
Cacchiani, Valentina ;
Qi, Jianguo ;
Yang, Lixing .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2020, 136 :1-29
[4]   Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems [J].
Delage, Erick ;
Ye, Yinyu .
OPERATIONS RESEARCH, 2010, 58 (03) :595-612
[5]  
Domencich T., 1975, Urban travel demand: A behavioural analysis
[6]   A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times [J].
Errico, F. ;
Desaulniers, G. ;
Gendreau, M. ;
Rei, W. ;
Rousseau, L. -M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (01) :55-66
[7]   Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations [J].
Esfahani, Peyman Mohajerin ;
Kuhn, Daniel .
MATHEMATICAL PROGRAMMING, 2018, 171 (1-2) :115-166
[8]  
Fei S., 2018, URBAN MASS TRANSIT, V21, P100
[9]   Equity-Oriented Train Timetabling with Collaborative Passenger Flow Control: A Spatial Rebalance of Service on an Oversaturated Urban Rail Transit Line [J].
Gong, Chaoqi ;
Mao, Baohua ;
Wang, Min ;
Zhang, Tong .
JOURNAL OF ADVANCED TRANSPORTATION, 2020, 2020
[10]   Train timetabling with dynamic and random passenger demand: A stochastic optimization method [J].
Gong, Congcong ;
Shi, Jungang ;
Wang, Yanhui ;
Zhou, Housheng ;
Yang, Lixing ;
Chen, Dewang ;
Pan, Hanchuan .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 123