Optimization of Train Scheduling in a Single Rail Network

Abstract

Train scheduling in a rail network is very important for controlling a hundred of trains moving through a complex network. Mostly, the delay is caused by bottle neck problems, which frequently occur in a single rail network. As a result, a mathematical model was applied to optimize the train scheduling in a single rail network with flexible path. The objective is to minimize travelling time of all trains while satisfying all operational constraints, For example, the trains must keep moving continuously, train confliction should be avoided for safety reason and a track contains only one train at a time. A solution was achieved by having travelling time of all trains at all stations including arrival and departure time of the trains reported and reflected in form of graph by plotting data between distance and time until no conflict occurs in the system, after all. This method not only can compute an acceptable time but also is quicker than the original way. An optimal time table solution was obtained through optimization, which made scheduling process much more efficiently.