Train running time allocation algorithm based on dynamic programming

This paper studies energy efficient optimization of operation diagram by allocating train running time. By taking intermediate stations as areas with zero speed restriction, such problem is converted into train optimal operation problem between two stations. In this way, the allocation of running time is regarded as a multi-stage decision making process without aftereffect, and dynamic programming is applied to solve this problem. In accordance with the fact that traditional train running time allocation does not take energy efficiency into consideration, this paper sets time deviation and energy consumption as total cost. Considering train and line parameters, a backward optimal record is established through differential train moving model in order to find optimal running time allocation with lowest total energy consumption. Simulation results show that current rail timetable still has potentials for energy efficient optimization.