On the Complexity of Train Assignment Problems

Authors:
Thomas Erlebach;Martin Gantenbein;Daniel Hürlimann;Gabriele Neyer;Aris Pagourtzis;Paolo Penna;Konrad Schlude;Kathleen Steinhöfel;David Scot Taylor;Peter Widmayer
Affiliations:
-;-;-;-;-;-;-;-;-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 3
Cited 0

Discrete optimization in public rail transport

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
On Approximation Scheme Preserving Reducability and Its Applications

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Hardness of Approximating Problems on Cubic Graphs

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions by hand, a time-consuming task which is too slow for interaction with the schedule creators. Further, it is difficult to measure how efficient the manual solutions are. We consider several variants of the problem. For some, we give efficient methods to solve them optimally, while for others, we prove hardness results and propose approximation algorithms.