摘要
城市轨道交通成网运营后,列车运行计划编制问题也变得复杂。为统筹协调全运输网络内的换乘衔接,优化城市轨道交通末班车时刻表,针对城市轨道交通末班车的开行特点,以最大限度满足旅客需求为目标,构建末班车衔接方案的赋权有向图模型,提出一种结合客流需求的末班车到发时刻编制算法,即改进的Edmond算法,求解末班车衔接方案,并推算路网末班车时刻表。最后,通过算例对模型算法进行验算。结果表明,该算法可以根据需求产生相应方案,为城市轨道交通网络运营组织提供决策依据。
The train timetabling problem becomes quite complex and difficult in urban mass transit, when it turns to network operation. The optimization of last train timetabling is the comprehensive allocation of various resources in the entire network. This paper proposes an idea of algorithm for last train timetabling, which meets the passengers' demand. Based on the analysis of last trains' connection properties, this paper builds a directed weighted graph model for connection scheme of last trains, and proposes the optimization algorithm for connection scheme based on Edmond's algorithm. Then, depending on the connection scheme obtained by solving the model, this paper proposes the calculation method for time schedule of the last trains. Finally, the paper takes an example to verify the proposed model and algorithm which proves the method, proposes the corresponding scheme and provides the evidence for decision-making of operation organization.
出处
《铁道运输与经济》
北大核心
2017年第11期103-110,共8页
Railway Transport and Economy
基金
北京交通大学基本科研业务费人才基金项目(T16JB00100)
神华包神铁路集团项目(T17L00830)
关键词
城市轨道交通
网络运营
末班车衔接
时刻表
Edmond算法
Urban Mass Transit
Train Operation on Network
Last Train Connection Scheme
Timetabling
Edmond Algorithm