Engineering the modulo network simplex heuristic for the periodic timetabling problem

Goerigk, Marc and Schöbel, Anita (2011) Engineering the modulo network simplex heuristic for the periodic timetabling problem. In: Experimental Algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . Springer, GRC, pp. 181-192. ISBN 9783642206610

Full text not available from this repository.


The Periodic Event Scheduling Problem (PESP), in which events have to be scheduled repeatedly over a given period, is a complex and well-known discrete problem with numerous real-world applications. One of them is to find periodic timetables which is economically important, but difficult to handle mathematically, since even finding a feasible solution to this problem is known to be NP-hard. On the other hand, there are recent achievements like the computation of the timetable of the Dutch railway system that impressively demonstrate the applicability and practicability of the mathematical model. In this paper we propose different approaches to improve the modulo network simplex algorithm [8], which is a powerful heuristic for the PESP problem, by exploiting improved search methods in the modulo simplex tableau and larger classes of cuts to escape from the many local optima. Numerical experiments on railway instances show that our algorithms are able to handle problems of the size of the German intercity railway network.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
10 Nov 2015 09:16
Last Modified:
20 Sep 2023 02:20