An Energy-Efficient Train Operation Approach by Integrating the Metro Timetabling and Eco-Driving

2019 
Energy-efficient train operation is regarded as an effective way to reduce the operational cost and carbon emissions in metro systems. Reduction of the traction energy and increasing of the regenerative energy are two important ways for saving energy, which is closely related to the train timetable and driving strategy. To minimize the systematic net energy consumption, i.e., the difference between the traction energy consumption and the reused regenerative energy, this paper proposes an integrated train operation approach by jointly optimizing the train timetable and driving strategy. A precise train driving strategy is presented and the timetable model considers the headway between successive trains, the distribution of the trip time, and passenger demand in this paper. In addition, a distributed regenerative braking energy model is proposed, based on which the integrated optimization model is formulated. Then, a two-level approach is proposed to solve the problem. At the driving strategy level, the train control problem is transferred into a multi-step decision problem and the Dynamic Programming method is introduced to calculate the energy-efficient driving strategy with the given trip time. As for the timetable level, the trip times and headway of trains are optimized by using the Simulated Annealing algorithm based on the results of dynamic programming method. The timetable optimization level balances the mechanical traction energy of multi-interstations and the amount of the reused regenerative energy such that the net mechanical energy consumption of the metro system is minimized. Furthermore, two numerical examples are conducted for train operations in the peak and off-peak hours separately based on the real-world data of a metro line. The simulation results illustrate that the proposed approach can produce a good performance on energy-saving.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    40
    References
    81
    Citations
    NaN
    KQI
    []