华南理工大学 土木与交通学院,广东,广州,510640
郑亚晶(1982–),男,讲师,博士,主要研究方向为轨道交通运行图铺画及轨道交通运输组织优化. E-mail:ctyjzheng@scut.edu.cn
网络首发:2019-11-28,
纸质出版:2019
移动端阅览
郑亚晶, 李雨恒, 李耀辉. 动车组周转、到发线运用和接发车进路排列方案的综合优化研究[J]. 广东工业大学学报, 2019, 36(6): 9-15.
Zheng Ya-jing, Li Yu-heng, Li Yao-hui. A Comprehensive Optimization of Multiple Unit Circulating, Utilization of Arrival-departure Track and Inbound-outbound Route Assignment[J]. 2019, 36(6): 9-15.
郑亚晶, 李雨恒, 李耀辉. 动车组周转、到发线运用和接发车进路排列方案的综合优化研究[J]. 广东工业大学学报, 2019, 36(6): 9-15. DOI: 10.12052/gdutxb.190072.
Zheng Ya-jing, Li Yu-heng, Li Yao-hui. A Comprehensive Optimization of Multiple Unit Circulating, Utilization of Arrival-departure Track and Inbound-outbound Route Assignment[J]. 2019, 36(6): 9-15. DOI: 10.12052/gdutxb.190072.
综合动车组周转、车站到发线运用和接发车进路排列3个相互衔接的作业过程
以动车组在运行线之间的接续关系、动车组占用到发线和道岔的相容性为约束条件
以运用动车组数量最少、到发线运用效用最大和接发列车总走行距离最小为优化目标
构建了综合性的多目标0-1型整数线性规划. 通过模型求解
可以同步得到动车组周转方案、到发线运用方案和接发车进路排列方案. 算例表明
本文构建的模型能够达到整体优化3个作业过程的目标
可以为实际的运营工作提供一定的决策支持.
Integrating the three successive processes (turnover of multiple unit
utilization of arrival-departure track and route assignment)
a multi objective 0-1 type integer linear programming of multiple unit circulating
utilization of arrival-departure track and inbound-outbound route assignment was established with the following relations of the train stock’s connecting conditions in different train running lines and the compatibility of the track and the switch occupied by the multiple unit
the minimum use of multiple unit
the maximum arrival-departure track utilization utility
and the minimum multiple unit travel distance were selected as the objectives. Through the model solution
the scheme of multiple unit circulating
utilization of arrival-departure track and inbound-outbound routes can be derived at the same time. Result show that global optimization for the three goals is achieved with the given model and algorithm and thus can provide some decision support for the actual operation.
SHI F, HU A Z. A linear algorithm to deploy a locomotive circulating diagram [J]. Journal of the China Railway Society, 1996, 18(4): 18-24.
TAO R, LYU H X, CHEN G X. Model and algorithm for making locomotive working diagram based on multiple traveling salesmen problem [J]. Journal of Southwest Jiaotong University, 2006, 41(5): 653-657.
XIE J B, YONG X. Algorithm of optimizing locomotive working diagram by using operational network technology [J]. Journal of the China Railway Society, 1996, 18(5): 9-13.
ZHENG Y J, ZHANG X C, ZHANG Q. Optimization of locomotive working diagram under locomotive arm routing and multi locomotive traction [J]. China Railway Science, 2013, 34(5): 134-139.
HE F D, HE D Y. A genetic algorithm for obtaining the optimal locomotive working diagram with double-shoulder circuit locomotive routing by the mode of unfixed traction [J]. China Railway Science, 2007, 28(1): 118-122.
YAN H F, CUI Y. Optimization model of locomotive working diagram [J]. China Railway Science, 2006, 27(4): 123-128.
ZHAO P, HU A Z, YANG H. Research on the circulating optimization in the condition of using high-speed passenger trains in uncertain railroad region [J]. Journal of Northern Jiaotong University, 1997, 21(6): 621-624.
MATI G, KROON L. Maintenance routing for train units: the transition model [J]. Transportation Science, 2005, 39(4): 518-525.
NIE L, ZHAO P, YANG H, et al . Study on motor train-set operation in high speed railway [J ] . J ournal of the China Railway Society, 2001, 23(3): 1-7.
XIE M Q, NIE L. Model of cyclic train timetable [J]. Journal of the China Railway Society, 2009, 31(4): 7-13.
SHI F, WEI T J, ZHOU W L, et al . Optimization method for train diagram of high-speed railway considering the turnover of multiple units and the utilization of arrival-departure tracks [J ] . China Railway Science, 2012, 33(2): 107-114.
SHI F, CHEN Y, QIN J, et al . Comprehensive optimization of arrival-departure track utilization and inbound-outbound route assignment in railway passenger station [J ] . China Railway Science, 2009, 30(6): 108-113.
0
浏览量
0
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621