Refine
Document Type
- In Proceedings (3)
- ZIB-Report (3)
- Bachelor's Thesis (1)
- Master's Thesis (1)
Language
- English (8)
Is part of the Bibliography
- no (8)
Keywords
Institute
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.