Optimization of Train Speed Profile for Minimum Energy Consumption

Abstract

The optimal operation of railway systems minimizing total energy consumption is discussed in this paper. Firstly, some measures of finding energy-saving train speed profiles are outlined. After the characteristics that should be considered in optimizing train operation are clarified, complete optimization based on optimal control theory is reviewed. Their basic formulations are summarized taking into account most of the difficult characteristics peculiar to railway systems. Three methods of solving the formulation, dynamic programming (DP), gradient method, and sequential quadratic programming (SQP), are introduced. The last two methods can also control the state of charge (SOC) of the energy storage devices. By showing some numerical results of simulations, the significance of solving not only optimal speed profiles but also optimal SOC profiles of energy storage are emphasized, because the numerical results are beyond the conventional qualitative studies. Future scope for applying the methods to real-time optimal control is also mentioned. 

Multi-train trajectory optimisation to maximise rail network energy efficiency under travel-time constraints

“…At a low level, the trajectories of individual trains were optimised independently, while at a high level, train movements were synchronised using a GA. In 2007, Miyatake [12] extended the model in [11] to include exchange of energy between the trains and improved optimisation of train trajectories, and later compared the performance of different energy storage devices in [13].…”

Theoretical Study on Eco-Driving Technique for an Electric Vehicle with Dynamic Programming

“…If there is no calculation error, N x should be L . The penalty term in (8) gives the penalty value considering error between the terminal boundary condition and calculated result. The coefficients c 1 and c 2 should be adjusted by evaluating the results so as to obtain the best solution that best satisfies the terminal conditions and provides low energy consumption.…”

“…Bellman's dynamic programming (DP) has a substantial advantage in this area, since it can deal directly with the difficult constraints of optimal control problems, except for the terminal boundary conditions. There are several papers that deal with the energy-saving operation of vehicles with a certain kinds of optimization techniques as seen in [8]- [10]. However, they consider only the control of power trains.…”

A survey on optimal trajectory planning for train operations

“…The original problem is then transformed into a multi-state decision process. Dynamic programming, a gradient method, and sequential quadratic programming are introduced to solve the optimal trajectory planning problem in [31]. Under simple and complicated operation conditions, the simulations showed the gradient method had good convergence.…”