摘要
铁路环形班列在开行过程中存在着停站过多和货物等待装车时间过长的问题,导致班列时效性较差。为解决上述问题,从停站方案和发车时间2个方面对环形班列开行方案进行优化,将环形班列开行方案编制问题描述为动态服务网络设计问题,以运输收益最大为目标建立环形班列开行方案优化模型,设计基于遗传算法的启发式算法对模型进行求解。计算结果表明,该优化方法能够通过合理地调整班列停站方案和班列开行时间,大幅提升环形班列的时效性与运输效率。
For annular trains, there are two negative reasons causing poor timeliness in current operation. Too much stops reduce the average speed of the train. Moreover, goods waiting for loading at the original station causes overlong waiting time. To solve the above problems, this paper optimizes the operation scheme of annular trains from two aspects: the stop schedule plan and the departure time of annular trains. The problem of operation scheme of annular trains is described as the problem of dynamic service network design. An optimization model of operation schemes is built with the maximum transportation revenue and solved by a heuristic algorithm based on a genetic algorithm. The results show that this method can greatly improve the timeliness and transportation efficiency of annular trains through the adjustment of the stop schedule plan and the departure time of annular trains.
作者
马利
王鹏翔
李海鹰
王莹
MA Li;WANG Peng-xiang;LI Hai-ying;WANG Ying(Freight Division,China Railway Beijing Group Co.,Ltd.,Beijing 100860,China;State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University,Beijing 100044,China;School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China)
出处
《铁道运输与经济》
北大核心
2018年第9期98-103,共6页
Railway Transport and Economy
基金
国家重点研发计划资助(2017YFB1201301)
关键词
铁路
环形班列
动态服务网络
停站方案
发车时间
遗传算法
Railway
Annular Trains
Dynamic Service Network
Stop Plan
Departure Time
Genetic Algorithm