Train-scheduling for railway networks using basic kinematics and A*

Abstract

This thesis tackles the problem of finding time optimal routes for trains over a railway network. The problem is defined as follows: A train has a known length. The position of the train is defined over parts of one or more consecutive track segments. There are a maximum speed, a maximum acceleration and a maximum deceleration capability for the train. Each track segment has a maximum allowed speed for any train being over it. A problem instance is defined by an initial and a goal state, which are two positions accompanied with desired speeds (being usually, but not necessarily, zero). In this study we are interested in minimizing the total duration of reaching the goal state from the initial one; other metrics such as fuel consumption could be considered. We solve this problem using basic kinematics and A*. We present two algorithms: The first one computes analytically in continuous space the optimal speed profile of the train for a problem defined over a given path. The second algorithm extends the first one over arbitrary graphs. A* empowered with a simple admissible heuristic is employed to find the optimal combination of speed profile and path.