A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables

Liebchen, Christian2021-12-172021-12-1720052197-8085https://depositonce.tu-berlin.de/handle/11303/15571http://dx.doi.org/10.14279/depositonce-14344We consider the problem of satisfying the maximum number of constraints of an instance of the Periodic Event Scheduling Problem (PESP). This is a key issue in periodic railway timetable construction, and has many other applications, e.g. for traffic light scheduling.en510 Mathematikperiodic railway timetable optimizationapproximationA Cut-based Heuristic to Produce Almost Feasible Periodic Railway TimetablesResearch Paper