Abstract
The Periodic Event Scheduling Problem (PESP) is the central mathematical model behind the optimization of periodic timetables in public transport. We apply Benders decomposition to the incidence-based MIP formulation of PESP. The resulting formulation exhibits particularly nice features: The subproblem is a minimum cost network flow problem, and feasibility cuts are equivalent to the well-known cycle inequalities by Odijk. We integrate the Benders approach into a branch-and-cut framework, and assess the performance of this method on instances derived from the benchmarking library PESPlib.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4(1), 238–252 (1962)
Fischetti, M., Ljubić, I., Sinnl, M.: Redesigning Benders decomposition for large-scale facility location. Manag. Sci. 63(7), 2146–2162 (2017)
Gale, D.: A theorem on flows in networks. Pacific J. Math. 7(2), 1073–1082 (1957)
Goerigk, M.: PESPlib – a benchmark library for periodic event scheduling (2012). http://num.math.uni-goettingen.de/~m.goerigk/pesplib/
Liebchen, C.: Periodic timetable optimization in public transport. Ph.D. thesis, Technische Universität Berlin (2006)
Liebchen, C., Möhring, R.H.: The modeling power of the periodic event scheduling problem: railway timetables - and beyond. In: Geraets, F., Kroon, L., Schöbel, A., Wagner, D., Zaroliagis, C.D. (eds.) Algorithmic Methods for Railway Optimization. Lecture Notes in Computer Science, pp. 3–40. Springer, Berlin, Heidelberg (2007)
Nachtigall, K.: Periodic Network Optimization and Fixed Interval Timetables. Habilitation thesis, Universität Hildesheim (1998)
Nachtigall, K., Opitz, J.: Solving periodic timetable optimisation problems by modulo simplex calculations. In: Fischetti, M., Widmayer, P., (eds.), 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008), vol. 9, OpenAccess Series in Informatics (OASIcs), Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (2008)
Odijk, M.A.: Construction of periodic timetables, part 1: a cutting plane algorithm. Technical report 94-61, TU Delft (1994)
Odijk, M.A.: A constraint generation algorithm for the construction of periodic railway timetables. Transp. Res. Part B: Methodol. 30(6), 455–464 (1996)
Peeters, L.: Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus Universiteit Rotterdam (2003)
Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM J. Disc. Math. 2(4), 550–581 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Lindner, N., van Lieshout, R. (2022). Benders Decomposition for the Periodic Event Scheduling Problem. In: Trautmann, N., Gnägi, M. (eds) Operations Research Proceedings 2021. OR 2021. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-08623-6_43
Download citation
DOI: https://doi.org/10.1007/978-3-031-08623-6_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08622-9
Online ISBN: 978-3-031-08623-6
eBook Packages: Business and ManagementBusiness and Management (R0)