Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations

Abstract

Abstract. In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted sum of undesirable slack times. This problem can be formulated as a mixed integer linear problem, which for real world instances is hard to solve. This is mainly caused by the integer variables, the so-called modulo parameter. At first we will discuss some results on the polyhedral structure of the periodic timetable problem. These ideas allow to define a modulo simplex basic solution by calculating the basic variables from modulo equations. This leads to a modulo network simplex method, which iteratively improves the solution by changing the simplex basis.

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{Nachtigall2008SolvingPT, title={Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations}, author={Karl Nachtigall and Jens Opitz}, booktitle={ATMOS}, year={2008} }