Abstract
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.
Partially supported by grant SCHO 1140/3-1 within the DFG programme Algorithm Engineering.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kroon, L., Huisman, D., Abbink, E., Fioole, P., Fischetti, M., Marti, G., Schrijver, A., Steenbeek, A., Ybema, R.: The new dutch timetable: The OR revolution. Interfaces 39, 6–17 (2009)
Galli, L., Stiller, S.: Strong formulations for the multi-module PESP and a quadratic algorithm for graphical diophantine equation systems. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 338–349. Springer, Heidelberg (2010)
Liebchen, C.: Periodic Timetable Optimization in Public Transport. PhD thesis, Technische Universität Berlin (2006)
Liebchen, C.: The first optimized railway timetable in practice. Transportation Science 42(4), 420–435 (2008)
Liebchen, C., Möhring, R.: The modeling power of the periodic event scheduling problem: railway timetables — and beyond. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol. 4359, pp. 3–40. Springer, Heidelberg (2007)
Liebchen, C., Proksch, M., Wagner, F.H.: Performances of algorithms for periodic timetable optimization. In: Computer-aided Systems in Public Transport, pp. 151–180. Springer, Heidelberg (2008)
Nachtigall, K.: Periodic Network Optimization and Fixed Interval Timetables. Habilitationsschrift, Deutsches Zentrum für Luft- und Raumfahrt Braunschweig (1998)
Nachtigall, K., Opitz, J.: Solving periodic timetable optimisation problems by modulo simplex calculations. In: Proc. ATMOS (2008)
Odijk, M.: A constraint generation algorithm for the construction of periodic railway timetables. Transportation Research (B) 30, 455–464 (1996)
Peeters, L.: Cyclic Railway Timetable Optimization. PhD thesis, Erasmus University of Rotterdam (2003)
Schachtebeck, M., Schöbel, A.: Lintim – a toolbox for the experimental evaluation of the interaction of different planning stages in public transportation. Technical report, ARRIVAL Report 206 (2009)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM J. Disc. Math., 550–581 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerigk, M., Schöbel, A. (2011). Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-20662-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20661-0
Online ISBN: 978-3-642-20662-7
eBook Packages: Computer ScienceComputer Science (R0)