Abstract
Container stacking rules are an important factor in container terminal efficiency. In this paper, we investigate two concepts to increase efficiency and compare them to several benchmark algorithms, using a discrete-event simulation tool. The first concept is to use knowledge about container departure times, in order to limit the number of reshuffles. We stack containers leaving shortly before each other on top of each other. The second concept is the trade-off between stacking further away in the terminal versus stacking close to the exit points and accepting more reshuffles. It is concluded that even the use of imperfect or imprecise departure time information leads to significant improvements in efficiency. Minimizing the difference in departure times proved to be important. It was also found that the trade-off between stacking further away in the terminal versus stacking close by the exit points and accepting more reshuffles leads to improvements over the benchmark.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Axelrod R (1997) Simulating social phenomena. In: Advancing the art of simulation in the social sciences, Springer, Berlin, pp 21–40
Borgman B (2009) Improving container stacking efficiency using simulation. Master’s thesis, Erasmus School of Economics, Erasmus University Rotterdam. http://hdl.handle.net/2105/5040. Economics and Informatics programme
Caserta M, Voß S, Sniedovich M (2010) Applying the corridor method to a blocks relocation problem. OR Spectr. doi:10.1007/s00291-009-0176-5
Dekker R, Voogd P, van Asperen E (2006) Advanced methods for container stacking. OR Spectr 28: 563–586
Duinkerken MB, Evers JJ, Ottjes JA (2001) A simulation model for integrating quay transport and stacking policies in automated terminals. In: Proceedings of the 15th European simulation multiconference (ESM2001). SCS, Prague
Froyland G, Koch T, Megow N, Duane E, Wren H (2008) Optimizing the landside operation of a container terminal. OR Spectr 30: 53–75
Han Y, Lee LH, Chew EP, Tan KC (2008) A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr 30: 697–720
Hirashima Y, Takeda K, Harada S, Deng M, Inoue A (2006) A Q-learning for group-based plan of container transfer scheduling. JSME Int J Ser C 49(2): 473–479
Kang J, Oh MS, Ahn EY, Ryu KR, Kim KH (2006) Planning for intra-block remarshalling in a container terminal. In: Ali M, Dapoigny R (eds) Advances in applied artificial intelligence, Springer, Berlin, pp 1211–1220
Kim KH, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33: 940–954
L’Ecuyer P, Buist E (2005) Simulation in Java with SSJ. In: Kuhl ME, Steiger NM, Armstrong FB, Joines JA (eds) Proceedings of the 2005 winter simulation conference, pp 611–620
Lim A, Xu Z (2006) A critical-shaking neighborhood search for the yard allocation problem. Eur J Oper Res 174: 1247–1259
Park BJ, Choi HR, Kwon HK, Kang MH (2006) Simulation analysis on effective operation of handling equipments in automated container terminal. In: AI 2006: Advances in artificial intelligence, Lecture Notes in Computer Science, vol 4304, Springer, Berlin, pp 1231–1238
Saanen YA, Dekker R (2006a) Intelligent stacking as way out of congested yards? Part 1. Port Technol Int 31: 87–92
Saanen YA, Dekker R (2006) Intelligent stacking as way out of congested yards? Part 2. Port Technol Int 32: 80–86
Stahlbock R, Voss S (2008) Operations research at container terminals: a literature update. OR Spectr 30: 1–52
Steenken D, Voss S, Stahlbock R (2004) Container terminal operation and operations research ù a classification and literature review. OR Spectr 26: 3–49
Voogd P, Dekker R, Meersmans PJ (1999) FAMAS-Newcon: a generator program for stacking in the reference case. Tech. Rep. EI-9943/A, Econometric Institute, Erasmus University Rotterdam
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Borgman, B., van Asperen, E. & Dekker, R. Online rules for container stacking. OR Spectrum 32, 687–716 (2010). https://doi.org/10.1007/s00291-010-0205-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-010-0205-4