Abstract
This paper discusses the problem of generating schedules for railway wagons that serve a given timetable of trips and also allow for timely maintenance of the wagons. Routes of wagons have to be constructed as rotations so that a given objective, ideally the total cost, is minimized. A surrogate for cost minimization, used here, is to minimize the number of trains needed to carry out all the trips.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Crainic T. G., Rousseau J.-M., The Column Generation Principle and the Airline Crew Scheduling Problem. INFOR, Vol. 25, No. 2, 136–151, 1987.
Kottkamp F., Leser D.: A Decision Support System for Wagon Scheduling in Railways. Diploma Thesis, University of Paderborn, Decision Support and Operations Research Laboratory, 1996 (in German).
Mellouli T., Improving Vehicle Scheduling Support by Efficient Algorithms. In: Operations Research Proceedings 1996, pp. 307–312, Springer, Heidelberg.
van Laarhoven P.J., Aarts E.H.: Simulated Annealing: theory and applications. Reidel, 1987.
Suhl L: Computer-Aided Scheduling — an Airline Perspective. Gabler Deutsche Universitaets-Verlag, Wiesbaden 1995.
Suhl U.: MOPS — Mathematical Optimization System. Benutzerhandbuch Version 2.5, Freie Universitaet Berlin, 1995.
Vidal R.V.: Applied Simulated Annealing. Springer, Berlin, Heidelberg, 1993.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Myers, D.C., Suhl, L. (1998). Scheduling Wagon Maintenance at Deutsche Bahn. In: Operations Research Proceedings 1997. Operations Research Proceedings, vol 1997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58891-4_88
Download citation
DOI: https://doi.org/10.1007/978-3-642-58891-4_88
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64240-4
Online ISBN: 978-3-642-58891-4
eBook Packages: Springer Book Archive