Optimal Sorting of Rolling Stock at Hump Yards

Ronny S. Hansmann () and Uwe T. Zimmermann ()
Additional contact information
Ronny S. Hansmann: Institute of Mathematical Optimization
Uwe T. Zimmermann: Institute of Mathematical Optimization

A chapter in Mathematics – Key Technology for the Future, 2008, pp 189-203 from Springer

Abstract: 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.

Keywords: Optimal Schedule; Input Sequence; Feasible Schedule; Output Sequence; Sequence Version (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-77203-3_14

Ordering information: This item can be ordered from
http://www.springer.com/9783540772033

DOI: 10.1007/978-3-540-77203-3_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().