Positioning of loading units in a transshipment yard storage area

Authors:
Florian Jaehn
Affiliations:
Institut für Wirtschaftsinformatik, Universität Siegen, Siegen, Germany 57068
Venue:
OR Spectrum
Year:
2013

Citing 8
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting Yard

Transportation Science
A heuristic rule for relocating blocks

Computers and Operations Research
An assignment model for dynamic load planning of intermodal trains

Computers and Operations Research
Scheduling Freight Trains in Rail-Rail Transshipment Yards

Transportation Science
Applying the corridor method to a blocks relocation problem

OR Spectrum
New bounds and algorithms for the transshipment yard scheduling problem

Journal of Scheduling
Optimized load planning of trains in intermodal transportation

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers a decision problem as it arises in a rail---road transshipment yard when unloading a bundle of trains. The loading units, e.g. containers, arriving on trains and occasionally arriving on trucks have to be placed on storage lanes of limited capacity. Loading units are placed and removed keeping stacking and crane rail moves small. We present two NP-hard models and some heuristics for solving the problem. One of these heuristics is currently applied at the yard. The algorithms are then tested using real-life data.