On the Complexity of Train Assignment Problems
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 timeconsuming 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.
KeywordsVertex Cover Maintenance Station Minimum Vertex Cover Train Schedule Vehicle Schedule
Unable to display preview. Download preview PDF.
- 1.P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd Italian Conference on Algorithms and Complexity, LNCS 1203, pages 288–298, Berlin, 1997. Springer-Verlag.Google Scholar
- 3.P. Brucker, J.L. Hurink, and T. Rolfes. Routing of railway carriages: A case study. Memorandum No. 1498, University of Twente, Fac. of Mathematical Sciences, 1999.Google Scholar
- 8.J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. Elsevier, 1995.Google Scholar
- 9.T. Erlebach, M. Gantenbein, D. Hürlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D.S. Taylor, and P. Widmayer. On the complexity of train assignment problems. Technical report, Swiss Federal Institute of Technology Zürich (ETH), 2001. Available at http://www.inf.ethz.ch/.
- 10.R. Freling, J.M.P. Paixão, and A.P.M. Wagelmans. Models and algorithms for vehicle scheduling. Report 9562/A, Econometric Institute, Erasmus University Rotterdam, 1999.Google Scholar
- 11.A. Löbel. Optimal vehicle scheduling in public transit. PhD thesis, TU Berlin, 1998.Google Scholar