Inhalt des Dokuments
Preprint 06-2005
Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)- Title
- A Cut-based Heuristic to Produce Almost Feasible Periodic Railway Timetables
- Author
- Publication
- In Proceedings of WEA 2005, Springer LNCS 3503
- Classification
-
MSC: primary: 05C90 Applications secondary: 05C15 Coloring of graphs and hypergraphs 90B20 Traffic problems 90C27 Combinatorial optimization - Keywords
-
Periodic Railway Timetable Optimization, Approximation
- Abstract
-
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.We generalize two (in-) approximability results, which are known for MAXIMUM-k-COLORABLE-SUBGRAPH. Moreover, we present a deterministic combinatorial polynomial time algorithm. Its output violates only very few constraints for five real-world instances.
- Source
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe