高速铁路网络动车组运用优化分解算法*

doi:10.16265/j.cnki.issn1003-3033.2019.S2.002

中国安全科学学报 ›› 2019, Vol. 29 ›› Issue (S2): 10-17.doi: 10.16265/j.cnki.issn1003-3033.2019.S2.002

高速铁路网络动车组运用优化分解算法^*

钟庆伟^1,2, 张永祥^1,2, 文超^**1,2,3 副教授, 彭其渊^1,2 教授, 王锰锰⁴

1 西南交通大学交通运输与物流学院,四川成都 610031;
2 综合交通运输智能化国家地方联合工程实验室,四川成都 610031;
3 滑铁卢大学铁路研究中心,加拿大滑铁卢 N2L3G1;
4 中国郑州铁路局集团有限公司郑州动车段,河南郑州 450000

收稿日期:2019-08-05 修回日期:2019-10-16 出版日期:2019-12-30 发布日期:2020-10-28
作者简介:钟庆伟 (1991—),男,四川什邡人,博士研究生,主要研究方向为高速铁路动车组运用管理。E-mail: qingweizhong@my.swjtu.edu.cn。
基金资助:
国家自然科学基金资助(71871188, 61503311);四川省科技厅应用基础研究项目(2018JY0567)。

Optimized decomposition algorithm for train-set scheduling of high-speed railway network

ZHONG Qingwei^1,2, ZHANG Yongxiang^1,2, WEN Chao^1,2,3, PENG Qiyuan^1,2, WANG Mengmeng⁴

1 School of Transportation & Logistics, Southwest Jiaotong University, Chengdu Sichuan 610031, China;
2 National United Engineering Laboratory of Integrated and Intelligent Transportation, Chengdu Sichuan 610031, China;
3 Railway Research Center, University of Waterloo, Waterloo, N2L3G1, Canada;
4 Zhengzhou Depot, China Railway Zhengzhou Group Co., Ltd., Zhengzhou Henan 450000, China

Received:2019-08-05 Revised:2019-10-16 Online:2019-12-30 Published:2020-10-28

摘要/Abstract

摘要： 针对高速铁路网络化运营背景下带维修约束的多车种、多动车所的动车组运用优化问题,提出一个新颖的2阶段优化分解算法。第1阶段基于多商品网络流理论(MCFP),建立不考虑维修约束的动车组交路计划混合整数线性规划模型(MILP),以获得多种动车组备选交路计划方案;第2阶段将获得的备选交路计划方案中的交路转换为单个动车组单元的可行路径集合,建立带维修约束的动车组单元指派模型来检验其维修可行性。结果表明:所提出的算法相比于现场人工方法节省4个8编组的动车组、减少38.4%的总空驶距离并降低3%的运营成本;通过更加灵活的编组方式进一步提高了动车组的运用效率。

关键词: 高速铁路, 动车组交路计划, 优化分解算法, 维修约束, 混合整数线性规划模型(MILP)

Abstract: The train-set scheduling optimization problem with multiple train-sets and multiple depots considering maintenance requirementswas investigated, and a novel two-stage decomposition algorithm was proposed. Firstly, a multi-commodity flow-based MILP optimization model for train-set schedulingwithout consideringmaintenance requirementswas established to obtain multiple candidates train-set schedules. Thenbased on the multiple candidate train-set schedules generated in the first stage, the second stage of the algorithm generated a set of feasible paths for each single train-set unit, where a path allocation sub-problem with maintenance constraints was developed to check the maintenance feasibility. The results show that the proposed optimization approach can save foureight-car size train sets, reduce the total deadhead mileage by 38.4% and save 3% operating cost compared to the manual schedule, and that the operation efficiency of train-setcan be further improvedthrough a more flexible way of composition.

Key words: high-speed railway, train-set circulation plan, decomposition algorithm, maintenance requirements, mixed integer linear programming (MILP)

中图分类号:

X951

钟庆伟, 张永祥, 文超, 彭其渊, 王锰锰. 高速铁路网络动车组运用优化分解算法^*[J]. 中国安全科学学报, 2019, 29(S2): 10-17.

ZHONG Qingwei, ZHANG Yongxiang, WEN Chao, PENG Qiyuan, WANG Mengmeng. Optimized decomposition algorithm for train-set scheduling of high-speed railway network[J]. China Safety Science Journal, 2019, 29(S2): 10-17.

参考文献 18

[1]	黄平, 文超, 李忠灿,等. 高速铁路列车晚点时间实时预测的神经网络模型[J]. 中国安全科学学报, 2019,29(增1):20-26.HUANG Ping, WEN Chao, LI Zhongcan, et al.A neural network model for real-time prediction of high-speed railway delays[J].China Safety Science Journal,2019, 29(S1):20-26.
[2]	彭其渊, 张永祥, 鲁工圆, 等. 基于时空资源的铁路客运站到发线运用调整[J]. 同济大学学报:自然科学版, 2018, 47(7):1 011-1 021.PENG Qiyuan, ZHANG Yongxiang, LU Gongyuan, et al. Arrival and departure tracks utilization adjustment method in railway passenger stations based on time-space resources[J]. Journal of Tongji University:Natural Science, 2019,47(7):1 011-1 021.
[3]	钟庆伟, 赵军, 文超, 等. 城轨线路运营时段前车底空驶出场路径优化[J]. 铁道学报, 2018, 40(3):29-38.ZHONG Qingwei, ZHAO Jun, WEN Chao, et al. Optimizing rolling stock deadhead routing problem before operation period of urban rail transit line[J]. Journal of the China Railway Society, 2018, 40(3):29-38.
[4]	ABBINK E, BIANCA V D B, KROON L, et al. Allocation of railway rolling stock for passenger trains[J]. Transportation Science, 2004, 38(1):33-41.
[5]	ALFIERI A, GROOT R, KROON L, et al. Efficient circulation of railway rolling stock[J]. Transportation Science, 2006, 40(3):378-391.
[6]	FIOOLE P J, KROON L, GÁBOR M, et al. A rolling stock circulation model for combining and splitting of passenger trains[J]. European Journal of Operational Research, 2006, 174(2):1 281-1 297.
[7]	GÁBOR M, KROON L. Maintenance routing for train units: the transition model[J]. Computers & Operations Research, 2005, 39(4):518-525.
[8]	GÁBOR M, KROON L. Maintenance routing for train units: the interchange model[J]. Computers & Operations Research, 2007, 34(4):1 121-1 140.
[9]	BORNDRFER R, REUTHER M, SCHLECHTE T, et al. Integrated optimization of rolling stock rotations for intercity railways[J]. Transportation Science, 2015, 50(3):863-877.
[10]	HAAHR J, LUSBY R M. Integrating rolling stock scheduling with train unit shunting[J]. European Journal of Operational Research, 2017, 259(2):452-468.
[11]	聂磊, 赵鹏, 杨浩, 等. 高速铁路动车组运用的研究[J].铁道学报, 2001, 23(3):1-7.NIE Lei, ZHAO Peng, YANG Hao,et al. Study on motor trainset operation in high speed railway [J]. Journal of the China Railway Society, 2001, 23(3):1-7.
[12]	赵鹏, 富井规雄. 动车组运用计划及其编制算法[J]. 铁道学报, 2003, 25(3):1-7.ZHAO Peng, NORIO T. Train-set scheduling and an algorithm [J]. Journal of the China Railway Society, 2003, 25(3):1-7.
[13]	赵鹏, 富井规雄. 基于路段交换的多基地动车组运用计划的编制算法[J]. 铁道学报, 2004, 26(1):7-11.ZHAO Peng, NORIO T. An algorithm for multiple-bases train-set scheduling based on path-exchange[J]. Journal of the China Railway Society, 2004, 26(1):7-11.
[14]	史峰, 周文梁, 郁宇卫, 等. 客运专线动车组运用计划优化模型与算法[J]. 铁道学报, 2011, 33(1):8-13.SHI Feng, ZHOU Wenliang, YU Yuwei,et al. Optimized model and algorithm of motor trains-sets scheduling for dedicated passenger lines [J]. Journal of the China Railway Society, 2011, 33(1):8-13.
[15]	张才春, 陈建华, 花伟. 基于不同检修能力的动车组运用计划研究[J].中国铁道科学, 2010, 31(5):130-133.ZHANG Caichun, CHEN Jianhua, HUA Wei. Research on the EMU operation plan based on different maintenance capacity [J].China Railway Science, 2010, 31(5):130-133.
[16]	李华, 韩宝明, 张琦,等. 动车组交路计划优化模型与算法研究[J]. 铁道学报, 2013, 35(3):1-8.LI Hua, HAN Baoming, ZHANG Qi,et al. Research on optimization model and algorithm of EMU circulation plan [J]. Journal of the China Railway Society, 2013, 35(3):1-8.
[17]	陈旭, 李海鹰, 王莹, 等. 放射状路网条件下动车组运用优化研究[J]. 铁道学报, 2017, 39(11):28-34.CHEN Xu, LI Haiying, WANG Ying, et at. Research on Optimization of EMU scheduling for Radial HSR Network [J]. Journal of the China Railway Society, 2017, 39(11):28-34.
[18]	我国首列可变编组动车组已具备出厂条件 [EB/OL]. (2019-02-25).http://www.gd.xinhuanet.com/newscenter/2019-02/25/c_1124157073.htm.

高速铁路网络动车组运用优化分解算法^*

Optimized decomposition algorithm for train-set scheduling of high-speed railway network

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献 18

相关文章 15

编辑推荐

Metrics

本文评价

[1]	贾飞, 孟学雷, 贾宝通, 李涛, 张杨. 突发公共卫生事件下高速铁路客流分配研究[J]. 中国安全科学学报, 2021, 31(6): 153-160.
[2]	董皓, 崔有泉, 孙丽君. 高速铁路安全环境治理分析[J]. 中国安全科学学报, 2020, 30(S1): 32-37.
[3]	章超荣. 高速铁路沿线无人机安全管理立法探讨[J]. 中国安全科学学报, 2020, 30(S1): 38-42.
[4]	龙时丹. 面向高速铁路的全自动运行系统应用[J]. 中国安全科学学报, 2020, 30(S1): 92-97.
[5]	杨晓丽, 刘向东. 高速铁路工程竣工验收存在的问题与探讨[J]. 中国安全科学学报, 2020, 30(S1): 146-151.
[6]	魏圆圆, 左忠义, 程伟, 孟子悦. F-ANP法在高速铁路风险评估中的应用[J]. 中国安全科学学报, 2020, 30(S1): 165-171.
[7]	汤轶雄, 徐传玲, 文超, 李忠灿, 宋邵杰. 高铁故障晚点时间预测的支持向量回归模型^*[J]. 中国安全科学学报, 2019, 29(S2): 18-23.
[8]	李力, 闫迪, 田锐, 王全泉. 基于晚点恢复的高速铁路行车调度质量评价^*[J]. 中国安全科学学报, 2019, 29(S2): 118-125.
[9]	宋雨欣. GUI下的高速铁路客运站安全评价系统^*[J]. 中国安全科学学报, 2019, 29(S2): 134-137.
[10]	李程睿, 赵明, 尹盼盼, 刘美池, 马乐陶. 高速铁路客运站安全评价^*[J]. 中国安全科学学报, 2019, 29(S2): 149-153.
[11]	胡瑞, 徐传玲, 冯永泰, 文超, 王全泉. 广深高速铁路列车分类型晚点预测^*[J]. 中国安全科学学报, 2019, 29(S2): 181-186.
[12]	黄平, 文超, 李忠灿, 杨宇翔, 彭其渊. 高速铁路列车晚点时间实时预测的神经网络模型^*[J]. 中国安全科学学报, 2019, 29(S1): 20-26.
[13]	王江丽, 王俊, 蒋帅. 高速铁路安全防护系统设计研究^*[J]. 中国安全科学学报, 2019, 29(S1): 58-62.
[14]	于胜利, 程梁, 肖超, 高喜成, 王保江, 宋浩. 浅谈高铁变形监测内容与铁路运营安全的关系^*[J]. 中国安全科学学报, 2019, 29(S1): 180-185.
[15]	李建明. 数据驱动的高速铁路列车掉分相诊断方法^*[J]. 中国安全科学学报, 2019, 29(S1): 192-196.