Real-Time Optimal Speed Coordination and Scheduling for High-Speed Trains Based on Model Predictive Control

Abstract:

In the high-speed train control system, the command information such as allowable running distance, time and speed can be sent by the global system for mobile communications for railways (GSM-R). This paper will propose the framework of real-time train scheduling and control based on model predictive control for the optimal speed set-points of high-speed trains. The rolling optimization process combines the genetic algorithm with the simulation of train operation to evaluate the performance of speed set-points, which can be easily implemented in the parallel computing environment for real-time processing. The conflict resolution at the crossing stations is modeled by and embedded in the combination of various speed set-points which are formed from virtual to simulation speed. The final actual speed of train is engendered based on the movement authority and running time through the system of automatic train protection (ATP). The simulation results demonstrate the favorable performance of proposed method.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 6043-6048
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.6043
• Online since: January 2012
• Authors: Yong Hua Zhou, Yang Peng Wang, Pin Wu, Peng Wang
• Keywords: Automatic Train Protection (ATP), Centralized Traffic Control (CTC), Genetic Algorithm (GA), Model Predictive Control (MPC), Train Predictive Scheduling

References

[1] A. D'Ariano, D. Pacciarelli, and M. Pranzo, A branch and bound algorithm for scheduling trains in a railway network, European Journal of Operational Research, vol. 183, pp.643-657, December (2007).

DOI: 10.1016/j.ejor.2006.10.034

[2] A. D'Ariano, M. Pranzo, and I. A. Hansen, Conflict resolution and train speed coordination for solving real-time timetable perturbations, IEEE Transactions on Intelligent Transportation Systems, vol. 8, pp.208-222, June (2007).

DOI: 10.1109/tits.2006.888605

[3] X. Zhou, and M. Zhong, Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds, Transportation Research, Part B, vol. 41, pp.320-341, March (2007).

DOI: 10.1016/j.trb.2006.05.003

[4] F. Corman, A. D'Ariano, D. Pacciarelli, and M. Pranzo, A tabu search algorithm for rerouting trains during rail operations, Transportation Research, Part B, vol. 44, pp.175-192, January (2010).

DOI: 10.1016/j.trb.2009.05.004

[5] A. Caprara, M. Monaci, P. Toth, and P. L. Guida, A Lagrangian heuristic algorithm for a real-world train timetabling problem, Discrete Applied Mathematics, vol. 154, pp.738-753, April (2006).

DOI: 10.1016/j.dam.2005.05.026

[6] M. B. Khan, D. Zhang, M. S. Jun, and Z. J. Li., An intelligent search technique to train scheduling problem based on genetic algorithm, Proceedings of International Conference on Emerging Technologies, (ICET 06), November 2006, pp.593-598.

DOI: 10.1109/icet.2006.335970

[7] F. Li, Z. Gao, K. Li, and L. Yang, Efficient scheduling of railway traffic based on global information of train, Transportation Research, Part B, vol. 42, pp.1008-1030, December (2008).

DOI: 10.1016/j.trb.2008.03.003

[8] M. A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, and A. Lova, Domain-dependent distributed models for railway scheduling, Knowledge-Based Systems, vol. 20, pp.186-194.

DOI: 10.1016/j.knosys.2006.11.013