ENERGY EFFICIENT STRATEGIES FOR SCHEDULING TRAINS ON A LINE

Abstract Scheduling trains on a single railway line is treated by converting the scheduling problem to a discrete event dynamic system, and converting a greedy time-efficient strategy to an energy efficient schedule. While such a schedule cannot be referred to as a strategy dependent solely on the state of the system the strategy is easily re-computed when perturbations in the nominal schedule occur.

[1]  Eugene Khmelnitsky,et al.  On an optimal control problem of train operation , 2000, IEEE Trans. Autom. Control..

[2]  Phil Howlett,et al.  Energy-efficient train control , 1994 .

[3]  Erhan Kozan,et al.  MODELING SINGLE-LINE TRAIN OPERATIONS , 1995 .

[4]  M. Meyer,et al.  An algorithm for the optimal control of the driving of trains , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[5]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[6]  E R Kraft.  A BRANCH AND BOUND PROCEDURE FOR OPTIMAL TRAIN DISPATCHING , 1987 .