首页 | 本学科首页   官方微博 | 高级检索  
     检索      

新建铁路不同O-D列车路径重叠分流最优化研究
引用本文:杨小燕,常治平,裴瑞江.新建铁路不同O-D列车路径重叠分流最优化研究[J].铁道运输与经济,2019(4):39-46.
作者姓名:杨小燕  常治平  裴瑞江
作者单位:南京铁道职业技术学院运输管理学院
基金项目:江苏省教育厅教育教学改革课题(2017JSJG368);江苏省轨道交通控制工程技术研究开发中心开放基金项目(KFJ201507)
摘    要:为改善新建铁路线造成相关区段运输网络复杂度提高而引起多个O-D可选路径出现重叠的情况,以满足最大车流、总体运输任务完成的时间最短、运输总换算成本最少3个目标的主次级别为依据,建立多目标数学模型,筛选出优秀的分流方案,将新旧路网分流出现路径重叠时可能导致的相关路网车流过大,以及原有铁路线路上密度过大的车流及折角列车流对编组站和关系区段运输效率造成的不良影响降到最低,运用模型对新建呼准鄂快速铁路运输需分流数据进行实例分析,最终找到具体运输时间和换算成本之间的平衡点,选出最符合实际情况的分流方案,结果对不同O-D列车路径重叠时分流优化研究具有参考价值。

关 键 词:新建铁路  分流方案  有向网络图  路径重叠  启发式算法

A Study of the Optimization of Diverting Different O-D Train Flows on Overlapped Path of Newly Built Railway Lines
YANG Xiaoyan,CHANG Zhiping,PEI Ruijiang.A Study of the Optimization of Diverting Different O-D Train Flows on Overlapped Path of Newly Built Railway Lines[J].Rail Way Transport and Economy,2019(4):39-46.
Authors:YANG Xiaoyan  CHANG Zhiping  PEI Ruijiang
Institution:(School of Transportation Management,Nanjing Institute of Railway Technology,Nanjing 210031,Jiangsu,China)Abstract: The)
Abstract:The operation of new railway lines may complicate the related sections and cause the overlapping of possible paths of multiple O-D. To solve this problem, this paper establishes a multi-objective mathematical model and screens out the optimal diversion schemes based on the primary and secondary levels of the three objectives of maximum traffic flow, the shortest time to complete the overall transport task and the least total transport conversion cost, so as to minimize the adverse effects of overlapping paths between the old and new road networks on the transport efficiency of marshalling yards and related sections, which are caused by overlapping traffic flows in the relevant road networks, excessive density of traffic flow and turnaround train flow on the original railway lines. Using the model to analyze the diversion data of Hohehot-Junggar-Erdos Express Railway, this paper finally finds a balance point between the specific transportation time and conversion cost, and chooses the most suitable diversion scheme. The result has an important reference value for the study of diversion optimization when different O-D train paths overlapping.
Keywords:Newly Built Railway Line  Train Diverting Schemes  Directed Network Graph  Overlapping Paths  Heuristic Algorithm
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号