6064 2016 eng conferenceobject 0 -- -- -- Periodic timetabling is an important strategic planning problem in public transport. The task is to determine periodic arrival and departure times of the lines in a given network, minimizing the travel time of the passengers. We extend the modulo network simplex method, a well-established heuristic for the periodic timetabling problem, by integrating a passenger (re)routing step into the pivot operations. Computations on real-world networks show that we can indeed find timetables with much shorter total travel time, when we take the passengers' travel paths into consideration. Operations Research Proceedings 2016 yes accepted for publication urn:nbn:de:0297-zib-60319 2016-10-21 Ralf Borndörfer Heide Hoppmann Heide Hoppmann Marika Karbstein Fabian Löbel Mathematical Optimization Mathematics of Transportation and Logistics Borndörfer, Ralf Hoppmann, Heide ECMath-MI3 Löbel, Fabian Applied Optimization