2005
DOI: 10.1541/ieejias.125.1084
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Study on Dynamic Programming Applied to Optimization of Running Profile of a Train

Abstract: An algorithm optimizing train running profile with Bellman's Dynamic Programming (DP) is investigated in this paper. Optimal running trajectory of a train which minimizes amount of total energy consumption has been produced under fixed origin and destination, stipulated running time and various track profile. Many previous works on this area adopt the numerical techniques of calculus of variations, Pontryagin's maximum principle, and so on. But these methods often meet some difficulties accounting for complica… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
82
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 74 publications
(84 citation statements)
references
References 1 publication
2
82
0
Order By: Relevance
“…The optimal train operation consists of the maximum acceleration, reduced acceleration by degrees, coasting and maximum deceleration. In previous works [1,2], we obtained the similar optimization result. Therefore, these results indicate the reliability of the proposed method.…”
Section: Optimization Resultssupporting
confidence: 72%
See 1 more Smart Citation
“…The optimal train operation consists of the maximum acceleration, reduced acceleration by degrees, coasting and maximum deceleration. In previous works [1,2], we obtained the similar optimization result. Therefore, these results indicate the reliability of the proposed method.…”
Section: Optimization Resultssupporting
confidence: 72%
“…However, from an energy-saving point of view, they did not deal enough with the optimality of the control of the devices. On the other hand, our previous works [1,2] was to optimize notch commands which determine the acceleration/deceleration force in the train without energy storage devices. We optimize notch commands together with charge/discharge commands with making use of the experience of our previous study.…”
Section: Introductionmentioning
confidence: 99%
“…It is worth to note that the analytical methods often meet difficulties to find the analytic solution if more realistic conditions are considered that introduce complex nonlinear terms into the model equations and the constraints [25].…”
Section: B the Optimal Trajectory Planning With Continuous-inputmentioning
confidence: 99%
“…Ko et al [25] apply Bellman's dynamic programming to optimize the optimal reference trajectory. The original problem is then transformed into a multi-state decision process.…”
Section: B Dynamic Programmingmentioning
confidence: 99%
“…The optimization of operation style of a vehicle was studied to reduce energy consumed by using coasting abundantly in the run between stations [1]. Moreover, a research which plans energy reduction by adjusting operation of two or more trains is also advanced such as the CATO system [2].…”
Section: Introductionmentioning
confidence: 99%