TY - CHAP A1 - Löbel, Fabian A1 - Lindner, Niels A1 - Borndörfer, Ralf ED - Neufeld, Janis S. ED - Buscher, Udo ED - Lasch, Rainer ED - Möst, Dominik ED - Schönberger, Jörn T1 - The Restricted Modulo Network Simplex Method for Integrated Periodic Timetabling and Passenger Routing T2 - Operations Research Proceedings 2019 N2 - The Periodic Event Scheduling Problem is a well-studied NP-hard problem with applications in public transportation to find good periodic timetables. Among the most powerful heuristics to solve the periodic timetabling problem is the modulo network simplex method. In this paper, we consider the more difficult version with integrated passenger routing and propose a refined integrated variant to solve this problem on real-world-based instances. Y1 - 2020 SN - 978-3-030-48438-5 U6 - https://doi.org/https://doi.org/10.1007/978-3-030-48439-2_92 SP - 757 EP - 763 PB - Springer International Publishing CY - Cham ER -