A cut-based heuristic to produce almost feasible periodic railway timetables

Authors:
Christian Liebchen
Affiliations:
Institut für Mathematik, TU Berlin, Berlin, Germany
Venue:
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Year:
2005

Citing 4
Cited 1

A mathematical for periodic scheduling problems

SIAM Journal on Discrete Mathematics
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A genetic algorithm approach to periodic railway synchronization

Computers and Operations Research

Integral cycle bases for cyclic timetabling

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

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.