Abstract
In this paper we provide a quite general description of a class of problems called Sorting of Rolling Stock Problem(s). An SRSP consists in finding an optimal schedule for rearranging units of rolling stock (railcars, trams, trains, . . . ) at shunting yards, covering a broad range of specially structured applications. Here, we focus on versions of SRSP at particular shunting yards featuring a hump. We analyze the use of such a hump yard in our research project Zeitkritische Ablaufbergoptimierung in Rangierbahnhöfen 1 in cooperation with BASF, The Chemical Company, in Ludwigshafen. Among other results we present a remarkably efficient algorithm with linear running time for solving the practical SRSP at the BASF hump yard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.L. Bodlaender and K. Jansen. Restrictions of graph partition problems. Part I. Theoretical Computer Science, 148(1):93–109, 1995.
E. Dahlhaus, P. Horak, M. Miller, and J.F. Ryan. The train marshalling problem. Discrete Applied Mathematics, 103(1–3):41–54, 2000.
E. Dahlhaus, F. Manne, M. Miller, and J.F. Ryan. Algorithms for combinatorial problems related to train marshalling. In Proceedings of AWOCA 2000, pages 7–16, Hunter Valley, 2000.
G. Di Stefano and M.L. Koči. A graph theoretical approach to the shunting problem. Electronic Notes in Theoretical Computer Science, 92:16–33, 2004.
G. Di Stefano, St. Krause, M.E. Lübbecke, and U.T. Zimmermann. On minimum k-modal partitions of permutations. In J.R. Correa, A. Hevia, and M. Kiwi, editors, Latin American Theoretical Informatics (LATIN2006), volume 3887 of Lecture Notes in Computer Science, pages 374–385. Springer-Verlag, Berlin, 2006.
G. Di Stefano and U.T. Zimmermann. Short note on complexity and approximability of unimodal partitions of permutations. Technical report, Inst. Math. Opt., Braunschweig University of Technology, 2005.
F.V. Fomin, D. Kratsch, and J.-Ch. Novelle. Approximating minimum cocolourings. Information Processing Letters, 84(5):285–290, 2002.
R.S. Hansmann. Optimal sorting of rolling stock (in preparation). PhD thesis, Inst. Math. Opt., Braunschweig Technical University Carolo-Wilhelmina.
R.S. Hansmann and U.T. Zimmermann. The sorting of rolling stock problem (in preparation).
D.S. Hirschberg and M. Régnier. Tight bounds on the number of string subsequences. Journal of Discrete Algorithms, 1(1):123–132, 2000.
R. Jacob. On shunting over a hump. unpublished. 2007.
K. Jansen. The mutual exclusion scheduling problem for permutation and comparability graphs. Information and Computation, 180(2):71–81, 2003.
K. Wagner. Monotonic coverings of finite sets. Elektronische Informationsverarbeitung und Kybernetik, 20(12):633–639, 1984.
T. Winter. Online and real-time dispatching problems. PhD thesis, Inst. Math. Opt., Technical University Carolo-Wilhelmina, 2000.
T. Winter and U.T. Zimmermann. Real-time dispatch of trams in storage yards. Annals of Operations Research, 96:287–315, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hansmann, R., Zimmermann, U. (2008). Optimal Sorting of Rolling Stock at Hump Yards. In: Krebs, HJ., Jäger, W. (eds) Mathematics – Key Technology for the Future. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77203-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-77203-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77202-6
Online ISBN: 978-3-540-77203-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)