Thumbnail Image
🆕 Date Issued:
2005
🗄 In DepositOnce:2021-12-17
Submitted Version

Please use this identifier to cite or link to this item:

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

Liebchen, Christian

Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin

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.
periodic railway timetable optimizationapproximation
In Copyright
Full item page