New bounds and algorithms for the transshipment yard scheduling problem
Publication date
2012-11-24
Document type
Forschungsartikel
Author
Organisational unit
Institut für Wirtschaftsinformatik, Universität Siegen
Scopus ID
Publisher
Springer Science and Business Media
Series or journal
Journal of Scheduling
ISSN
Periodical volume
15
Periodical issue
4
First page
499
Last page
511
Part of the university bibliography
Nein
Language
English
Keyword
Branch-And-bound
Ejection chain
Railway systems
Train scheduling
Transshipment yard
Abstract
In a modern rail-rail transshipment yard huge gantry cranes transship containers between different freight trains, so that hub-And-spoke railway systems are enabled. In this context, we consider the transshipment yard scheduling problem (TYSP) where trains have to be assigned to bundles, which jointly enter and leave the yard. The objective is to minimize split moves and revisits. Split moves appear whenever containers have to be exchanged between trains of different bundles, whereas revisits occur if a train has to enter the yard twice, because some container dedicated to this train was not available during its first visit. We extend the basic TYSP, so that additional real-world requirements of modern rail-rail yards, e.g., the one currently constructed in Hannover-Lehrte, are considered. We provide complexity proofs for different problem settings and present several heuristic procedures as well as one exact algorithm. The paper concludes with computational results showing the efficiency of the proposed algorithms. © Springer Science+Business Media, LLC 2011.
Version
Published version
Access right on openHSU
Metadata only access