Model and optimize train scheduling on railways network
Tutor / directorCervelló Pastor, Cristina
Document typeMaster thesis
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
In this work, a mathematical formulation of the train scheduling problem is provided as a Mixed Integer Linear Program. The MILP can be solved for easy cases, but computation time makes it impractical for more complex examples. Then a genetic algorithm is employed in the solution of the problem, with heuristic techniques to generate an initial population. The algorithm is applied to a number of problem instances producing feasible, though not optimal, solutions in less then one minute. Some improvements are suggested to obtain better results and further improve computation time.
Generating a railway timetable is known to be an NP-hard problem. While scheduling few trains is easy, complications quickly explode with increasing number of trains. The most important factors contributing to complexity are interdepencies between trains (such as connections) and the inability of trains to overtake one another on the same track.
DegreeMÀSTER UNIVERSITARI EN ENGINYERIA DE TELECOMUNICACIÓ (Pla 2013)