Train Speed Trajectory Optimization using Dynamic Programming with speed modes decomposition

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

When applying a dynamic programming algorithm to train speed trajectory optimization, there is a problem of too many discrete points which leading to dimension disaster. Different from using uniform discretization of the time and space by previous research, In this paper, a train operation model is proposed based on conditions (speed limit and slope change) and described in the network diagram. Armed with this model, through the pre-planning of the line, the optimization model of train operation is established, and the dynamic programming algorithm is utilized to find the global optimal value of train traction energy consumption. Taking Beijing Yizhuang line as a simulation case, the validity of the proposed model is verified by comparing common optimization algorithms. The results demonstrate that the proposed model can effectively reduce the calculation time of the dynamic programming algorithm by 95.06%, and has better optimization effect. The energy-saving effect reaches 6.0806%.

Cite

CITATION STYLE

APA

Wang, P., Peng, Y., Gao, X. J., & Gao, H. H. (2019). Train Speed Trajectory Optimization using Dynamic Programming with speed modes decomposition. In IOP Conference Series: Materials Science and Engineering (Vol. 569). Institute of Physics Publishing. https://doi.org/10.1088/1757-899X/569/4/042019

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free