Literature Review on Container Handling in the Yard Area

  • Filip Covic
Part of the Contributions to Management Science book series (MANAGEMENT SC.)


A wide-ranging literature review is conducted in this chapter surveying container handling problems in the time-span 1997–2018. The problems of the surveyed studies are systematically classified according to the scheme described in the previous chapter and compared based on key properties for practical yard block planning as well as for a theoretical analysis of container stacking. These include the problem scope, the planning hierarchy, time and input data properties and the modelling and solution methods among others. The results are presented in an extensive table classifying each of the 61 studies surveyed according to ten problem properties. Based on this, the main conclusions about each property are extracted and summarised in order to identify the key research streams in container handling in yard blocks. Afterwards, the literature review is aligned with other literature reviews in this field and a conclusion is given in order to provide a comprehensive overview of container handling problems. Eventually, this should support the identification of open questions in existing problems and the initialisation of new research streams in future research.


  1. Akyüz MH, Lee CY (2014) A mathematical formulation and efficient heuristics for the dynamic container relocation problem. Naval Res Logist 61 (2): 101–118CrossRefGoogle Scholar
  2. Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244 (3): 675–689CrossRefGoogle Scholar
  3. Borgman B, Asperen E van, Dekker R (2010) Online rules for container stacking. OR Spectr 32 (3): 687–716CrossRefGoogle Scholar
  4. Borjian S, Manshadi VH, Barnhart C, Jaillet P (2013) Dynamic stochastic optimization of relocations in container terminals. Working paper, MITGoogle Scholar
  5. Bortfeldt A, Forster F (2012) A tree search procedure for the container pre-marshalling problem. Eur J Oper Res 217 (3): 531–540CrossRefGoogle Scholar
  6. Bruns F, Knust S, Shakhlevich NV (2016) Complexity results for storage loading problems with stacking constraints. Eur J Oper Res 249 (3): 1074–1081CrossRefGoogle Scholar
  7. Carlo HJ, Vis IFA, Roodbergen KJ (2014) Storage yard operations in container terminals: Literature overview, trends, and research directions. Eur J Oper Res 235 (2): 412–430CrossRefGoogle Scholar
  8. Caserta M, Voß S (2009) A corridor method-based algorithm for the pre-marshalling problem. In: Giacobini M, Brabazon A, Cagnoni S, Di Caro GA, Ekárt A, Esparcia-Alcázar AI, Farooq M, Fink A, Machado P (eds) Applications of evolutionary computing, EvoWorkshops 2009. Volume 5484 of lecture notes in computer science. Springer, Berlin/Heidelberg, pp 788–797Google Scholar
  9. Caserta M, Schwarze S, Voß S (2009) A new binary description of the blocks relocation problem and benefits in a look ahead heuristic. In: Cotta C, Cowling P (eds) Evolutionary computation in combinatorial optimization, EvoCOP 2009. Volume 5482 of lecture notes in computer science. Springer, Berlin/Heidelberg, pp 37–48Google Scholar
  10. Caserta M, Schwarze S, Voß S (2011a) Container rehandling at maritime container terminals. In: Böse JW (ed) Handbook of terminal planning. Volume 49 of operations research/computer science interfaces series. Springer, New York, pp 247–269Google Scholar
  11. Caserta M, Voß S, Sniedovich M (2011b) Applying the corridor method to a blocks relocation problem. OR Spectr 33 (4): 915–929CrossRefGoogle Scholar
  12. Caserta M, Schwarze S, Voß S (2012) A mathematical formulation and complexity considerations for the blocks relocation problem. Eur J Oper Res 219 (1): 96–104CrossRefGoogle Scholar
  13. Chen L, Lu Z (2012) The storage location assignment problem for outbound containers in a maritime terminal. Int J Prod Econ 135 (1): 73–80CrossRefGoogle Scholar
  14. Choe R, Park T, Oh MS, Kang J, Ryu KR (2011) Generating a rehandling-free intra-block remarshaling plan for an automated container yard. J Intell Manuf 22 (2): 201–217CrossRefGoogle Scholar
  15. Covic F (2017) Re-marshalling in automated container yards with terminal appointment systems. Flex Serv Manuf J 29 (3–4): 433–503CrossRefGoogle Scholar
  16. Covic F (2018) A literature review on container handling in yard blocks. In: Cerulli R, Raiconi A, Voß S (eds) Computational logistics, ICCL 2018. Volume 11184 of lecture notes in computer science. Springer, Cham, pp 139–167Google Scholar
  17. Dekker R, Voogd P, Asperen E van (2007) Advanced methods for container stacking. In: Kim KH, Günther HO (eds) Container terminals and cargo systems. Springer, Berlin/Heidelberg, pp 131–154CrossRefGoogle Scholar
  18. Duinkerken MB, Evers JJM, Ottjes JA (2001) A simulation model for integrating quay transport and stacking policies on automated container terminals. In: Proceedings of the 15th European simulation multiconference, Prague, pp 909–916Google Scholar
  19. Expósito-Izquierdo C, Melián-Batista B, Moreno-Vega M (2012) Pre-marshalling problem: heuristic solution method and instances generator. Expert Syst Appl 39 (9): 8337–8349CrossRefGoogle Scholar
  20. Galle V, Barnhart C, Jaillet P (2018) A new binary formulation of the restricted container relocation problem based on a binary encoding of configurations. Eur J Oper Res 267 (2): 467–477CrossRefGoogle Scholar
  21. 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 (4): 697–720CrossRefGoogle Scholar
  22. Hottung A, Tierney K (2016) A biased random-key genetic algorithm for the container pre-marshalling problem. Comput Oper Res 75: 83–102CrossRefGoogle Scholar
  23. Huang SH, Lin TH (2012) Heuristic algorithms for container pre-marshalling problems. Comput Ind Eng 62 (1): 13–20CrossRefGoogle Scholar
  24. Jiang X, Lee LH, Chew EP, Han Y, Tan KC (2012) A container yard storage strategy for improving land utilization and operation efficiency in a transshipment hub port. Eur J Oper Res 221 (1): 64–73CrossRefGoogle Scholar
  25. Jin JG, Lee DH, Cao JX (2016) Storage yard management in maritime container terminals. Transp Sci 50 (4): 1300–1313CrossRefGoogle Scholar
  26. Jovanovic R, Voß S (2014) A chain heuristic for the blocks relocation problem. Comput Ind Eng 75: 79–86CrossRefGoogle Scholar
  27. Jovanovic R, Tuba M, Voß S (2017) A multi-heuristic approach for solving the pre-marshalling problem. Cent Eur J Oper Res 25 (1): 1–28CrossRefGoogle Scholar
  28. Kang J, Oh MS, Ahn EY, Ryu KR, Kim KH (2006a) Planning for intra-block remarshalling in a container terminal. In: Ali M, Dapoigny R (eds) Advances in applied artificial intelligence, IEA/AIE 2006. Volume 4031 of lecture notes in computer science. Springer, Berlin/Heidelberg, pp 1211–1220CrossRefGoogle Scholar
  29. Kang J, Ryu KR, Kim KH (2006b) Deriving stacking strategies for export containers with uncertain weight information. J Intell Manuf 17 (4): 399–410CrossRefGoogle Scholar
  30. Kemme N (2013) Design and operation of automated container storage systems. Contributions to management science, 1st edn. Physica, HeidelbergCrossRefGoogle Scholar
  31. Kim KH (1997) Evaluation of the number of rehandles in container yards. Comput Ind Eng 32 (4): 701–711CrossRefGoogle Scholar
  32. Kim KH, Bae JW (1998) Re-marshalling export containers in port container terminals. Comput Ind Eng 35 (3–4): 655–658CrossRefGoogle Scholar
  33. Kim KH, Hong GP (2006) A heuristic rule for relocating blocks. Comput Oper Res 33 (4): 940–954CrossRefGoogle Scholar
  34. Kim KH, Park KT (2003) A note on a dynamic space-allocation method for outbound containers. Eur J Oper Res 148 (1): 92–101CrossRefGoogle Scholar
  35. Kim KH, Park YM, Ryu KR (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124 (1): 89–101CrossRefGoogle Scholar
  36. Kozan E, Preston P (2006) Mathematical modelling of container transfers and storage locations at seaport terminals. OR Spectr 28 (4): 519–537CrossRefGoogle Scholar
  37. Ku D (2014) Rehandling problem of pickup containers under truck appointment system. In: Hwang D, Jung JJ, Nguyen NT (eds) Computational collective intelligence. Technologies and applications, ICCCI 2014. Volume 8733 of lecture notes in computer science. Springer, Cham, pp 272–281CrossRefGoogle Scholar
  38. Ku D, Arthanari TS (2016a) On the abstraction method for the container relocation problem. Comput Oper Res 68: 110–122CrossRefGoogle Scholar
  39. Ku D, Arthanari TS (2016b) Container relocation problem with time windows for container departure. Eur J Oper Res 252 (3): 1031–1039CrossRefGoogle Scholar
  40. Lee DH, Jin JG, Chen JH (2012) Terminal and yard allocation problem for a container transshipment hub with multiple terminals. Transp Res E Logist Transp Rev 48 (2): 516–528CrossRefGoogle Scholar
  41. Lee Y, Chao SL (2009) A neighborhood search heuristic for pre-marshalling export containers. Eur J Oper Res 196 (2): 468–475CrossRefGoogle Scholar
  42. Lee Y, Hsu NY (2007) An optimization model for the container pre-marshalling problem. Comput Oper Res 34 (11): 3295–3313CrossRefGoogle Scholar
  43. Lim A, Xu Z (2006) A critical-shaking neighborhood search for the yard allocation problem. Eur J Oper Res 174 (2): 1247–1259CrossRefGoogle Scholar
  44. Luo J, Wu Y, Halldorsson A, Song X (2011) Storage and stacking logistics problems in container terminals. OR Insight 24 (4): 256–275CrossRefGoogle Scholar
  45. Murty KG, Liu J, Wan Y, Linn R (2005a) A decision support system for operations in a container terminal. Decis Support Syst 39 (3): 309–332CrossRefGoogle Scholar
  46. Murty KG, Wan Y, Liu J, Tseng MM, Leung E, Lai KK, Chiu HWC (2005b) Hongkong international terminals gains elastic capacity using a data-intensive decision-support system. Interfaces 35 (1): 61–75CrossRefGoogle Scholar
  47. Park K, Park T, Ryu KR (2009) Planning for remarshaling in an automated container terminal using cooperative coevolutionary algorithms. In: Proceedings of the 2009 ACM symposium on applied computing, SAC 2009, Honolulu, pp 1098–1105Google Scholar
  48. Park T, Choe R, Kim YH, Ryu KR (2011) Dynamic adjustment of container stacking policy in an automated container terminal. Int J Prod Econ 133 (1): 385–392CrossRefGoogle Scholar
  49. Petering MEH, Hussein MI (2013) A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem. Eur J Oper Res 231 (1): 120–130CrossRefGoogle Scholar
  50. Preston P, Kozan E (2001) An approach to determine storage locations of containers at seaport terminals. Comput Oper Res 28 (10): 983–995CrossRefGoogle Scholar
  51. Rendl A, Prandtstetter M (2013) Constraint models for the container pre-marshaling problem. In: Katsirelos G, Quimper CG (eds) 12th international workshop on constraint modelling and reformulationm modRef, Uppsala, vol 13, pp 44–56Google Scholar
  52. Ries J, González-Ramírez RG, Miranda P (2014) A fuzzy logic model for the container stacking problem at container terminals. In: González-Ramírez RG, Schulte F, Voß S, Ceroni Díaz JA (eds) Computational logisitcs, ICCL 2014. Volume 8760 of lecture notes in computer science. Springer, Cham, pp 93–111Google Scholar
  53. Saurí S, Martín E (2011) Space allocating strategies for improving import yard performance at marine terminals. Transp Res E Logist Transp Rev 47 (6): 1038–1057CrossRefGoogle Scholar
  54. Sharif O, Huynh N (2013) Storage space allocation at marine container terminals using ant-based control. Exp Syst Appl 40 (6): 2323–2330CrossRefGoogle Scholar
  55. Tanaka S, Mizuno F (2008) An exact algorithm for the unrestricted block relocation problem. Comput Oper Res 95: 12–31CrossRefGoogle Scholar
  56. Tanaka S, Tierney K (2018) Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm. Eur J Oper Res 264 (1): 165–180CrossRefGoogle Scholar
  57. Tang L, Jiang W, Liu J, Dong Y (2015) Research into container reshuffling and stacking problems in container terminal yards. IIE Trans 47 (7): 751–766CrossRefGoogle Scholar
  58. Tierney K, Voß S (2016) Solving the robust container pre-marshalling problem. In: Paias A, Ruthmair M, Voß S (eds) Computational logistics, ICCL 2016. Volume 9855 of lecture notes in computer science. Springer, Cham, pp 131–145Google Scholar
  59. Tierney K, Pacino D, Voß S (2017) Solving the pre-marshalling problem to optimality with A* and IDA*. Flex Serv Manuf J 29 (2): 223–259CrossRefGoogle Scholar
  60. Ting CJ, Wu KC (2017) Optimizing container relocation operations at container yards with beam search. Transp Res E Logist Transp Rev 103: 17–31CrossRefGoogle Scholar
  61. Tricoire F, Scagnetti J, Beham A (2018) New insights on the block relocation problem. Comput Oper Res 89: 127–139CrossRefGoogle Scholar
  62. Ünlüyurt T, Aydın C (2012) Improved rehandling strategies for the container retrieval process. J Adv Transp 46 (4): 378–393CrossRefGoogle Scholar
  63. van Asperen E, Borgman B, Dekker R (2013) Evaluating impact of truck announcements on container stacking efficiency. Flex Serv Manuf J 25 (4): 543–556CrossRefGoogle Scholar
  64. Wan Y, Liu J, Tsai PC (2009) The assignment of storage locations to containers for a container stack. Naval Res Logist 56 (8): 699–713CrossRefGoogle Scholar
  65. Wang N, Jin B, Zhang Z, Lim A (2017) A feasibility-based heuristic for the container pre-marshalling problem. Eur J Oper Res 256 (1): 90–101CrossRefGoogle Scholar
  66. Yu M, Qi X (2013) Storage space allocation models for inbound containers in an automatic container terminal. Eur J Oper Res 226 (1): 32–45CrossRefGoogle Scholar
  67. Yu VF, Cheng HY, Ting HI (2009) Optimizing re-marshalling operation in export container terminals. In: Proceedings of the Asia Pacific industrial engineering & management systems conference, APIEMS 2009, Kitakyushu, pp 2934–2938Google Scholar
  68. Zehendner E, Feillet D (2014) Branch and price approach for the container relocation problem. Int J Prod Res 52 (24): 7159–7176CrossRefGoogle Scholar
  69. Zehendner E, Caserta M, Feillet D, Schwarze S, Voß S (2015) An improved mathematical formulation for the blocks relocation problem. Eur J Oper Res 245 (2): 415–422CrossRefGoogle Scholar
  70. Zehendner E, Feillet D, Jaillet P (2017) An algorithm with performance guarantee for the online container relocation problem. Eur J Oper Res 259 (1): 48–62CrossRefGoogle Scholar
  71. Zhang C, Liu J, Wan Y, Murty KG, Linn RL (2003) Storage space allocation in container terminals. Transp Res Part B Methodol 37 (10): 883–903CrossRefGoogle Scholar
  72. Zhang C, Chen W, Shi L, Zheng L (2010) A note on deriving decision rules to locate export containers in container yards. Eur J Oper Res 205 (2): 483–485CrossRefGoogle Scholar
  73. Zhao W, Goodchild AV (2010) The impact of truck arrival information on container terminal rehandling. Transp Res E Logist Transp Rev 46 (3): 327–343CrossRefGoogle Scholar
  74. Zhen L (2014) Storage allocation in transshipment hubs under uncertainties. Int J Prod Res 52 (1): 72–88CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Filip Covic
    • 1
  1. 1.Institute for Operations Research, HBS Hamburg Business SchoolUniversity of HamburgHamburgGermany

Personalised recommendations