Lu Yahan, Yang Lixing, Yang Kai, Gao Ziyou, Zhou Housheng, Meng Fanting, Qi Jianguo
State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing 100044, China.
Engineering (Beijing). 2022 May;12:202-220. doi: 10.1016/j.eng.2021.09.016. Epub 2021 Dec 24.
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.
常态化新型冠状病毒肺炎(COVID-19)疫情防控对城市轨道交通运营策略创新提出了新要求。为缓解日益严重的拥堵状况并进一步降低交叉感染风险,明确构建了一种新型两阶段分布鲁棒优化(DRO)模型,其中随机场景的概率分布仅部分已知。在所提出的模型中,采用均值条件风险价值(CVaR)准则来在城市轨道交通线路上的候车乘客期望数量与拥堵风险之间进行权衡。还描述了所提出的DRO模型与传统两阶段随机规划(SP)模型之间的关系。此外,为克服因概率分布不精确导致的模型可解性障碍,使用基于差异的模糊集将鲁棒对偶问题转化为其易于计算的形式。开发了一种将局部搜索算法与混合整数线性规划(MILP)求解器相结合的混合算法,以提高大规模实例的计算效率。最后,执行了一系列具有实际运营数据的数值示例来验证所提出的方法。