可变编组动车组运维一体化帕累托前沿分析

交通运输系统工程与信息 ›› 2019, Vol. 19 ›› Issue (6): 148-155.

可变编组动车组运维一体化帕累托前沿分析

付建军，张星臣^*，王志美

北京交通大学交通运输学院, 北京 100044

收稿日期:2019-06-24 修回日期:2019-10-16 出版日期:2019-12-25 发布日期:2019-12-25
作者简介:付建军(1974-)，男，内蒙古包头人，博士生.
基金资助:
国家自然科学基金/ National Natural Science Foundation of China(U1734204)；国家重点研发计划/ National Key Research and Development Project(2018YFB201401).

Integrated Model Method for Multiple-unit EMU Operation and Maintenance Based on Pareto Frontier Analysis

FU Jian-jun, ZHANG Xing-chen,WANG Zhi-mei

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

Received:2019-06-24 Revised:2019-10-16 Online:2019-12-25 Published:2019-12-25

摘要/Abstract

摘要：

动车组运用和检修是铁路运输生产的重要过程，占据很大的成本比例. 为与客流需求相匹配，在未来实现跨线动车组列车在某些枢纽站组合和分解存在可能，充分考虑组合动车组类型一致性，动车组在不同运行线进行重联与分解的接续条件，动车组进行一二级修的里程和时间标准等，以动车组的正常接续和空走接续时间里程费用、一二级维修作业费用、动车组运用费用和动车组接续时间费用之和最小及动车组空走费用占比最小为双目标，构建基于可变编组条件下的动车组运用和维修一体化模型方法.应用改进的非支配排序遗传算法求解，将目标值进行帕累托前沿分析，发现两者很难同时达到最优.模型的计算结果体现了动车组担当长编组运行线任务前后的组合和分解过程，同时也进一步分析了在动车组类型归一化或者动车组维修地点不受限情况下动车组运用数量的变化，反应了相关运行参数对结论的影响.

关键词: 铁路运输, 动车组运用方案, 帕累托前沿, 可变编组动车组, 非支配排序遗传算法

Abstract:

The utilization and maintenance of EMUs is an important process in railway transportation production, accounting for a large proportion of costs. In order to match the passenger flow demand, it is possible to realize the combination and decomposition of the EMU trains in some hub stations in the future. Under this assumption, we fully consider the consistency of combined motor trains, the connection conditions for reconnection and decomposition in different operation lines, primary and secondary maintenance costs. Based on the double target, the minimum sum of the EMU connection time costs and vehicle return empty costs, we construct an integrated model method for the EMUs' application and maintenance based on variable grouping conditions. The improved non- dominated sorting genetic algorithm is used to solve the problem and analyzed by Pareto frontier and we found that it is difficult to achieve optimality at the same time. The calculation results of the model reflect the combination and decomposition process of the EMU. At the same time, it also further analyzed the changes in the number of EMUs used in the case of normalization of the EMU type or the unrestricted maintenance position of the EMU, reflecting the impact of relevant operating parameters on the conclusion.

Key words: railway transportation, EMU operation plan, Pareto frontier, multiple- unit EMU, non- dominated sorting genetic algorithms

中图分类号:

U294.1

付建军，张星臣，王志美. 可变编组动车组运维一体化帕累托前沿分析[J]. 交通运输系统工程与信息, 2019, 19(6): 148-155.

FU Jian-jun, ZHANG Xing-chen,WANG Zhi-mei. Integrated Model Method for Multiple-unit EMU Operation and Maintenance Based on Pareto Frontier Analysis[J]. Journal of Transportation Systems Engineering and Information Technology, 2019, 19(6): 148-155.

导出引用管理器 EndNote|Ris|BibTeX

链接本文: http://www.tseit.org.cn/CN/abstract/abstract19953.shtml

http://www.tseit.org.cn/CN/Y2019/V19/I6/148

参考文献

[1] SCHRIJVER A. Minimum circulation of railway stock[J]. CWI Quart, 1993, 6(3): 205-217.

[2] MARÓTI G, KROON L. Maintenance routing for train units: The transition model[J]. Transportation Science, 2007, 34(4): 1121-1140.

[3] 赵鹏, 福井规雄. 基于路段交换的多基地动车组运用计划的编制算法[J]. 铁道学报, 2004, 26(1): 7-11. [ZHAO P, TOMII N. An algorithm for multiple-bases train-set scheduling based on path-exchange[J]. Journal of the China Railway Society, 2004, 26(1): 7- 11.]

[4] PEETERS M, KROON L. Circulation of railway rolling stock: A branch-and-price approach[J]. Computers & Operations Research, 2008, 35(2): 538-556.

[5] LAI Y C, FAN D C, HUANG K L. Optimizing rolling stock assignment and maintenance plan for passenger railway operations[J]. Computers & Industrial Engineering, 2015, 85(C): 284-295.

[6] 李华. 高速铁路动车组运用计划编制理论与方法研究 [D]. 北京: 北京交通大学, 2013. [LI H. Theory and method studies on EMU scheduling problem for high speed railway[D]. Beijing: Beijing Jiaotong University, 2013.]

[7] 周宇. 高速铁路成网条件下动车组运用计划编制理论与算法研究[D]. 北京: 北京交通大学, 2017. [ZHOU Y. Theory and algorithm research on train-set utilization problem under high speed railway network [D]. Beijing: Beijing Jiaotong University, 2017.]

[8] 李建. 动车组运用与检修计划综合优化方法研究[D]. 北京: 北京交通大学2017. [LI J. Research on integrated method for optimizing the assignment and maintenance plan of electrical multiple units[D]. Beijing: Beijing Jiaotong University, 2017.]

[9] 李健. 高速铁路动车组分配计划和日常检修计划一体化优化研究[D]. 北京: 北京交通大学, 2018. [ LI J. Research on integrated optimization of emu assignment and daily maintenance plan for high-speed railway[D] Beijing: Beijing Jiaotong University, 2018.]

[10] 冯士刚, 艾芊. 带精英策略的快速非支配排序遗传算法在多目标无功优化中的应用[J]. 电工技术学报, 2007, 22(12): 146-151. [FENG S G, AI Q. Application of fast and elitist non- dominated sorting generic algorithm in multi-objective reactive power optimization [J]. Transactions of China Electro Technical Society, 2007, 22(12): 146-151.]

[1]	耿庆桥, 贾元华, 陈军团. 基于变权可拓物元的铁路“走出去”公私合营项目风险决策[J]. 交通运输系统工程与信息, 2022, 22(2): 64-71.
[2]	戚建国, 周厚盛, 杨立兴, 周亚茹, 张春田. 灵活编组条件下轨道交通客货协同运输方案优化[J]. 交通运输系统工程与信息, 2022, 22(2): 197-205.
[3]	张晓明, 徐芳, 江文辉, 蒋朝哲. 考虑资金约束的中欧班列运价与运量决策分析[J]. 交通运输系统工程与信息, 2022, 22(1): 30-36.
[4]	张春田, 戚建国, 杨立兴, 高原, 高自友. 基于不确定旅客需求的高速铁路鲁棒列车开行方案研究[J]. 交通运输系统工程与信息, 2022, 22(1): 115-123.
[5]	周勇, 张杰, 钟祾充, 李文锋, 王国栋. 铁路集装箱中心站多轨道吊柔性协同调度优化[J]. 交通运输系统工程与信息, 2022, 22(1): 133-141.
[6]	牛惠民. 轨道列车时刻表问题研究综述[J]. 交通运输系统工程与信息, 2021, 21(5): 114-124.
[7]	刘葛辉，陈绍宽，刘爽，金华，王丹阳. 资源约束下城市轨道交通基础设施维修任务安排优化模型[J]. 交通运输系统工程与信息, 2021, 21(3): 163-169.
[8]	徐智勇. 铁路电分相布设及纵断面协同优化研究[J]. 交通运输系统工程与信息, 2021, 21(3): 170-175.
[9]	钟明轩，乐逸祥，周磊山. 高铁站列车和调车作业计划一体化编制方法[J]. 交通运输系统工程与信息, 2021, 21(3): 176-186.
[10]	吕敏，帅斌，周照玉，张士行，左静，李林卿. 考虑边境站延误风险的中欧班列运输路径决策[J]. 交通运输系统工程与信息, 2021, 21(3): 254-259.
[11]	张蒙蒙，许茂增. 考虑政府补贴决策的中欧班列竞合关系研究[J]. 交通运输系统工程与信息, 2021, 21(2): 16-21.
[12]	李岸隽，王典，彭其渊. 基于个体出行链的区域城际铁路规划方法研究[J]. 交通运输系统工程与信息, 2021, 21(2): 30-36.
[13]	汪茜，柏赟，李佳杰，朱巧珍，冯旭杰. 城市轨道交通地下线车站选址与平面线形优化[J]. 交通运输系统工程与信息, 2021, 21(2): 119-125.
[14]	刘晓伟，晏启鹏，倪少权，吕苗苗，吕红霞. 考虑空车调配协调的货物列车开行方案优化研究[J]. 交通运输系统工程与信息, 2021, 21(2): 180-188.
[15]	李晓娟，石佳娜，李得伟，闫振英. 考虑定制化列车的运行图与能力协同优化方法[J]. 交通运输系统工程与信息, 2021, 21(1): 95-100.