WIT Press


Application Of Dynamic Programming To The Optimization Of The Running Profile Of A Train

Price

Free (open access)

Paper DOI

10.2495/CR040111

Volume

74

Pages

10

Published

2004

Size

308 kb

Author(s)

H. Ko, T. Koseki & M. Miyatake

Abstract

An algorithm optimizing the train running profile with Bellman’s Dynamic programming (DP) is investigated in this paper. An optimal train running trajectory which minimizes amount of total consumed energy has been produced under fixed origin and destination, stipulated running time, limited electric motive force and electric brake by VVVF controlled induction motor/generator blended with mechanical brake, several local speed constraints and local inclines. Many previous works on this area adopt the numerical techniques of calculus of variations, Pontryagin’s maximum principle, incremental method, and so on. But these methods often meet some difficulties accounting for complicated actual train running preconditions, e.g. complicated functions which describe electrical motive/brake torque, local constraints o

Keywords