New bounds and algorithms for the transshipment yard scheduling problem

Authors:
Nils Boysen;Florian Jaehn;Erwin Pesch
Affiliations:
Lehrstuhl für Allgemeine Betriebswirtschaftslehre/Operations Management, Friedrich-Schiller-Universität Jena, Jena, Germany 07743;Institut für Wirtschaftsinformatik, Universität Siegen, Siegen, Germany 57068;Institut für Wirtschaftsinformatik, Universität Siegen, Siegen, Germany 57068
Venue:
Journal of Scheduling
Year:
2012

Citing 9
Cited 3

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
One-half approximation algorithms for the k-partition problem

Operations Research - Supplement
TSP ejection chains

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Survey of Optimization Models for Train Routing and Scheduling

Transportation Science
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard

Transportation Science
Shunting of Passenger Train Units in a Railway Station

Transportation Science
A tabu search heuristic for the quay crane scheduling problem

Journal of Scheduling
Scheduling Freight Trains in Rail-Rail Transshipment Yards

Transportation Science

How to park freight trains on rail---rail transshipment yards: the train location problem

OR Spectrum
Positioning of loading units in a transshipment yard storage area

OR Spectrum
A Survey on Container Processing in Railway Yards

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

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.