考虑维修天窗和到发线数量的复线铁路列车运行图优化  

Optimization for double-track railway train timetabling considering the maintenance skylight and the number of arrival-departure tracks

作　　者：兰泽康 何世伟[1] 黎浩东[1] 殷玮川 毕明凯 LAN Zekang;HE Shiwei;LI Haodong;YIN Weichuan;BI Mingkai(School of Traffic and Transportation,Beijing Jiaotong University,Bcijing 100044,China)

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《北京交通大学学报》2018年第3期30-36,共7页JOURNAL OF BEIJING JIAOTONG UNIVERSITY

基　　金：国家自然科学基金(U1434207;U1734204);中国铁路总公司科技研究开发计划项目(2017X004-E)~~

摘　　要：研究了维修天窗与复线铁路列车运行图一体化编制问题,考虑到发线数量、维修限速等约束条件,建立了混合整数规划模型.针对约束的特点对约束进行分类,并运用行生成方法对到发线数量等约束进行分解,运用两阶段法处理较为复杂的维修限速约束,结合商业软件GUROBI求解模型.设计算例进行验证,比较分析了模型约束的不同分解方法.结果显示分解到发线数量约束可以提高求解效率25%~45%,而列车追踪间隔间距约束是否宜采取分解与求解规模有关.This paper investigates the joint optimization on the maintenance skylight and double track railway train timetabling. A Mixed Integer Linear Progrom（MILP） model is established considering the number of arrival departure tracks, the speed restriction for maintenance. The constraints are classified according to their characteristics, and some kinds of constraints, e.g. the number of arrival departure tracks constraints are decomposed using row generation, then the model is solved by commercial software GUROBI. The model and algorithm is tested on a calcu lation example, in which different decomposition methods are compared, and a two stage ap proach is applied to deal with the complex maintenance restriction constraints. The results show that decomposing the number of arrival departure track constrains can improve the solving efficiency by 25%~45%, and whether it＇s beneficial to decompose the headway constrains depending on the solving scale.

关 键 词：铁路运输 列车运行图 行生成 维修天窗 GUROBI 

分 类 号：U292.41[交通运输工程—交通运输规划与管理]