Skip to main content
SpringerLink
Log in

Positioning of loading units in a transshipment yard storage area

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alicke K, Arnold D (1998) Modellierung und Optimierung von mehrstufigen Umschlagsystemen. Fördern und Heben 8:769–772

    Google Scholar 

  • Borgman B, van Asperen E, Dekker R (2010) Online rules for container stacking. OR Spectr 32: 687–716

    Article  Google Scholar 

  • Bostel N, Dejax P (1998) Models and algorithms for container allocation problems on trains in a rapid transshipment shunting yard. Transp Sci 32: 370–379

    Article  Google Scholar 

  • Boysen N, Fliedner M (2010) Determining crane areas in intermodal transshipment yards: the yard partition problem. Eur J Oper Res 204: 336–342

    Article  Google Scholar 

  • Boysen N, Jaehn F, Pesch E (2010) New bounds and algorithms for the transshipment yard scheduling problem. J Scheduling. doi:10.1007/s10951-010-0200-2

  • Boysen N, Jaehn F, Pesch E (2011) Scheduling freight trains in rail–rail transshipment yards. Transp Sci 45: 199–211

    Article  Google Scholar 

  • Bruns F, Knust S (2010) Optimized load planning of trains in intermodal transportation. OR Spectr. doi:10.1007/s00291-010-0232-1

  • Caserta M., Voß S, Sniedovich M (2009) Applying the corridor method to a blocks relocation problem. OR Spectr 31: 1–15

    Article  Google Scholar 

  • Corry P, Kozan E (2006) An assignment model for dynamic load planning of intermodal trains. Comput Oper Res 33: 1–17

    Article  Google Scholar 

  • Corry P, Kozan E (2008) Optimised loading patterns for intermodal trains. OR Spectr 30: 721–750

    Article  Google Scholar 

  • Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectr 28: 563–586

    Article  Google Scholar 

  • Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, New York

    Google Scholar 

  • Józefowska J (2012) Just-in-time scheduling in modern mass production environment. In: Ríos-Mercado RZ, Ríos-Solís YA (eds) Just-in-time systems. Springer optimization and its applications, vol 60. Springer, Berlin, pp 171–190

    Google Scholar 

  • Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–103

    Chapter  Google Scholar 

  • Kim KH, Hong G-P (2006) A heuristic rule for relocating blocks. Comput Oper Res 33: 940–954

    Article  Google Scholar 

  • Kim KH, Park YM, Ryu K-R (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124: 89–101

    Article  Google Scholar 

  • Kombiverkehr (2008) Frachtbehälter Einteilung nach Längenklassen, UIC

  • Kozan E (1997) Increasing the operational efficiency of container terminals in Australia. J Oper Res Soc 48: 151–161

    Google Scholar 

  • Montemanni R, Smith D, Rizzoli A, Gambardella L (2009) Sequential ordering problems for crane scheduling in port terminals. Int J Simul Process Model 5: 348–361

    Article  Google Scholar 

  • Souffriau W, Vansteenwegen P, Berghe GV, Oudheusden DV (2009) Variable neighbourhood descent for planning crane operations in a train terminal. In: Sörensen K, Sevaux M, Habenicht W, Geiger MJ (eds) Metaheuristics in the service industry. Lecture notes in economics and mathematical systems, vol 624. Springer, Berlin, pp 83–98

    Chapter  Google Scholar 

  • Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30: 1–52

    Google Scholar 

  • Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research: a classification and literature review. OR Spectr 26: 3–49

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Wirtschaftsinformatik, Universität Siegen, Hölderlinstraße 3, Siegen, 57068, Germany

    Florian Jaehn

Authors
  1. Florian Jaehn
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florian Jaehn.

Additional information

This work has been supported by the German Science Foundation (DFG) through the Grant “Optimierung der Containerabfertigung in Umschlagbahnhöfen” (BO 3148/1-1 and PE 514/16-1).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jaehn, F. Positioning of loading units in a transshipment yard storage area. OR Spectrum 35, 399–416 (2013). https://doi.org/10.1007/s00291-012-0281-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-012-0281-8

Keywords

Search

Navigation