Loading…
A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables
A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables
Liebchen, Christian
Inst. Mathematik
We 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.