Advertisement

Flexible Services and Manufacturing Journal

, Volume 27, Issue 2–3, pp 224–262 | Cite as

Seaside operations in container terminals: literature overview, trends, and research directions

  • Héctor J. Carlo
  • Iris F. A. Vis
  • Kees Jan Roodbergen
Article

Abstract

Seaside operations are considered the bottleneck operation in most container terminals around the world. This paper presents an in-depth updated overview of the seaside operations at container terminals and highlights current trends and developments. We review and classify scientific journal papers on container terminal seaside operations, published between 2004 and 2012. The paper also discusses and challenges the current operational paradigms on seaside operations. Lastly, the paper identifies new avenues for academic research based on current trends and developments in the container terminal industry.

Keywords

Container terminal Literature overview Seaside operations Material handling equipment 

Notes

Acknowledgments

The authors would like to acknowledge Groningen Seaports for supporting this research.

References

  1. Arango C, Cortés P, Muñuzuri J, Onieva L (2011) Berth allocation planning in Seville inland port by simulation and optimization. Adv Eng Inform 25:452–461Google Scholar
  2. Bierwirth C, Meisel F (2009) A fast heuristic for quay crane scheduling with interference constraints. J Sched 12:345–360MATHMathSciNetGoogle Scholar
  3. Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202:615–627MATHGoogle Scholar
  4. Blazewicz J, Cheng TCE, Machowiak M, Oguz C (2011) Berth and quay crane allocation: a moldable task scheduling model. J Oper Res Soc 62:1189–1197Google Scholar
  5. Boysen N, Emde S, Fliedner M (2012) Determining crane areas for balancing workload among interfering and noninterfering cranes. Nav Res Logist 59:656–662MathSciNetGoogle Scholar
  6. Buhrkal K, Zuglian S, Ropke S, Larsen J, Lusby R (2011) Models for the discrete berth allocation problem: a computational comparison. Transp Res Part E 47:461–473Google Scholar
  7. Chang D, Yan W, Chen C-H, Jiang Z (2008) A berth allocation strategy using heuristics algorithm and simulation optimisation. Int J Comput Appl Technol 32(4):272–281Google Scholar
  8. Chang D, Jiang Z, Yan W, He J (2010) Integrating berth allocation and quay crane assignments. Transp Res Part E 46:975–990Google Scholar
  9. Chao S-L, Lin Y-J (2011) Evaluating advanced quay cranes in container terminals. Transp Res Part E 47:432–445Google Scholar
  10. Chen L, Bostel N, Dejax P, Cai J, Xi L (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur J Oper Res 181(1):40–58MATHMathSciNetGoogle Scholar
  11. Chen JH, Lee DH, Cao JX (2012) A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals. Transp Res Part E Logist Transp Rev 48(1):266–275Google Scholar
  12. Cheong CY, Tan KC, Liu DK, Lin CJ (2010) Multi-objective and prioritized berth allocation in container ports. Ann Oper Res 180:63–103MATHMathSciNetGoogle Scholar
  13. Christensen CG, Holst CT, (2008) Berth allocation in container terminals Master’s Thesis Department of Informatics and Mathematical Modelling Technical University of Denmark (in Danish)Google Scholar
  14. Chung SH, Choy KL (2012) A modified genetic algorithm for quay crane scheduling operations. Expert Syst Appl 39(4):4213–4221Google Scholar
  15. Cordeau JF, Laporte G, Legato P, Moccia L (2005) Models and tabu search heuristics for the berth-allocation problem. Transp Sci 39(4):526–538Google Scholar
  16. De Oliveira RM, Mauri GR, Lorena LAN (2012) Clustering search for the berth allocation problem. Expert Syst Appl 39(5):5499–5505Google Scholar
  17. Ganji SRS, Babazadeh A, Arabshahi N (2010) Analysis of the continuous berth allocation problem in container ports using a genetic algorithm. J Mar Sci Technol 15:408–416Google Scholar
  18. Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B 44(2):232–245Google Scholar
  19. Golias MM (2011) A bi-objective berth allocation formulation to account for vessel handling time uncertainty. Marit Econ Logist 13(4):419–441Google Scholar
  20. Golias MM, Boile M, Theofanis S (2009a) Berth scheduling by customer service differentiation: a multi-objective approach. Transp Res Part E 45:878–892Google Scholar
  21. Golias MM, Saharidis GK, Boile M (2009b) The berth allocation problem: optimizing vessel arrival time. Marit Econ Logist 11(4):358–377Google Scholar
  22. Golias MM, Boile M, Theofanis S (2010) A lamda-optimal based heuristic for the berth scheduling problem. Transp Res Part C 18:794–806Google Scholar
  23. Goodchild AV, Daganzo CF (2006) Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transp Sci 40(4):473–483Google Scholar
  24. Guan Y, Cheung RK (2004) The berth allocation problem: models and solution methods. OR Spectrum 26(1):75–92CrossRefMATHMathSciNetGoogle Scholar
  25. Guan Y, Yang K-h (2010) Analysis of berth allocation and inspection operations in a container terminal. Marit Econ Logist 12(4):347–369Google Scholar
  26. Hakam MH, Solvang WD, Hammervoll T (2012) A genetic algorithm approach for quay crane scheduling with non-interference constraints at Narvik container terminal. Int J Logist Res Appl 15(4):269–281Google Scholar
  27. Han X-l, Lu Z-q, Xi L-f (2010) A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur J Oper Res 207:1327–1340MATHGoogle Scholar
  28. Hansen P, Oguz C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191:636–649MATHGoogle Scholar
  29. Hendriks M, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectrum 32(3):501–518CrossRefMATHGoogle Scholar
  30. Hendriks MPM, Armbruster D, Laumanns M, Lefeber E, Udding JT (2012) Strategic allocation of cyclically calling vessels for multi-terminal container operators. Flex Serv Manuf J 24(3):248–273Google Scholar
  31. Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res Part B 35:401–417Google Scholar
  32. Imai A, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39:199–221Google Scholar
  33. Imai A, Nishimura E, Hattori M, Papadimitriou S (2007a) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179:579–593MATHGoogle Scholar
  34. Imai A, Zhang J-T, Nishimura E, Papadimitriou S (2007b) The berth allocation problem with service time and delay time objectives. Marit Econ Logist 9:269–290Google Scholar
  35. Imai A, Chen HC, Nishimura E, Papadimitriou S (2008a) The simultaneous berth and quay crane allocation problem. Transp Res Part E 44:900–920Google Scholar
  36. Imai A, Nishimura E, Papadimitriou S (2008b) Berthing ships at a multi-user container terminal with a limited quay capacity. Transp Res Part E 44:136–151Google Scholar
  37. Kaveshgar N, Huynh N, Rahimian SK (2012) An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Syst Appl 39(18):13108–13117Google Scholar
  38. Kim J, Morrison JR (2012) Offshore port service concepts: classification and economic feasibility. Flex Serv Manuf J 24(3):214–245Google Scholar
  39. Kim KH, Park YM (2004) A crane scheduling method for port container terminals. Eur J Oper Res 156:752–768MATHGoogle Scholar
  40. Lang N, Veenstra A (2009) A quantitative analysis of container vessel arrival planning strategies. OR Spectrum 32(3):477–499CrossRefGoogle Scholar
  41. Lee Y, Chen C-Y (2009) An optimization heuristic for the berth scheduling problem. Eur J Oper Res 196:500–508MathSciNetGoogle Scholar
  42. Lee D-H, Chen JH (2010) An improved approach for quay crane scheduling with non-crossing constraints. Eng Optim 42(1):1–15Google Scholar
  43. Lee D-H, Wang HQ (2010a) Integrated discrete berth allocation and quay crane scheduling in port container terminals. Eng Optim 42(8):747–761MathSciNetGoogle Scholar
  44. Lee D-H, Wang HQ (2010b) An approximation algorithm for quay crane scheduling with handling priority in port container terminals. Eng Optim 42(12):1151–1161MathSciNetGoogle Scholar
  45. Lee D-H, Wang HQ, Miao L (2008a) Quay crane scheduling with handling priorities in port container terminals. Eng Optim 40(2):179–189Google Scholar
  46. Lee DH, Wang HQ, Miao L (2008b) Quay crane scheduling with non-interference constraints in port container terminals. Transp Res Part E 44:124–135Google Scholar
  47. Lee DH, Cao Z, Chen JH, Cao JX (2009) Simultaneous load scheduling of quay crane and yard crane in port container terminals. Transp Res Rec 2097:62–69Google Scholar
  48. Lee DH, Chen JH, Cao JX (2010) The continuous berth allocation problem: a greedy randomized adaptive search solution. Transp Res Part E 46:1017–1029Google Scholar
  49. Legato P, Mazza RM, Trunfio R (2010) Simulation-based optimization for discharge/loading operations at a maritime container terminal. OR Spectrum 32:543–567CrossRefMATHGoogle Scholar
  50. Legato P, Trunfio R, Meisel F (2012) Modeling and solving rich quay crane scheduling problems. Comput Oper Res 39(9):2063–2078MATHMathSciNetGoogle Scholar
  51. Liang C, Huang Y, Yang Y (2009) A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput Ind Eng 56:1021–1028Google Scholar
  52. Liang C, Guo J, Yang Y (2011) Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J Intell Manuf 22:471–479Google Scholar
  53. Lim A, Rodrigues B, Xiao F, Zhu Y (2004) Crane scheduling with spatial constraints. Nav Res Logist 51:386–406MATHMathSciNetGoogle Scholar
  54. Lim A, Rodrigues B, Xu Z (2007) A m-parallel crane scheduling problem with a non-crossing constraint. Nav Res Logist 54(2):115–127MATHMathSciNetGoogle Scholar
  55. Liu J, Wan YW, Wang L (2006) Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Nav Res Logist 53(1):60–74MATHMathSciNetGoogle Scholar
  56. Lokuge P, Alahakoon D (2007) Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents. Eur J Oper Res 177:1985–2015MATHGoogle Scholar
  57. Lu Z, Han X, Xi L, Erera AL (2012) A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Comput Oper Res 39(12):2915–2928MathSciNetGoogle Scholar
  58. Meisel F (2011) The quay crane scheduling problem with time windows. Nav Res Logist 58:619–636MATHMathSciNetGoogle Scholar
  59. Meisel F, Bierwirth C (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transp Res Part E 45:196–209Google Scholar
  60. Meisel F, Bierwirth C (2011) A unified approach for the evaluation of quay crane scheduling models and algorithms. Comput Oper Res 38:683–693Google Scholar
  61. Meisel F, Wichmann M (2010) Container sequencing for quay cranes with internal reshuffles. OR Spectrum 32(3):569–592CrossRefMATHGoogle Scholar
  62. Moccia L, Cordeau JF, Gaudioso M, Laporte G (2006) A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Nav Res Logist 53:45–59MATHMathSciNetGoogle Scholar
  63. Monaco MF, Sammarra M (2007) The berth allocation problem: a strong formulation solved by a lagrangean approach. Transp Sci 41(2):265–280Google Scholar
  64. Moorthy R, Teo CP (2006) Berth management in container terminal: the template design problem. OR Spectrum 28:495–518CrossRefMATHGoogle Scholar
  65. Nam H, Lee T (2012) A scheduling problem for a novel container transport system: a case of mobile harbor operation schedule. Flex Serv Manuf J 24(4) (in press), available at http://www.springerlink.com/content/1936-6590. doi: 10.1007/s10696-012-9135-6
  66. Ng WC, Mak KL (2006) Quay crane scheduling in container terminals. Eng Optim 38(6):723–737Google Scholar
  67. Pielage BA, Rijsenbrij JC, Van de Bosch W, Ligteringen H, Van Beemen J (2008) Floating cranes for container handling Port Research Centre Rotterdam-Delft The Netherlands ISBN/EAN: 978-90-5638-189-9 Available online: https://edit.portofrotterdam.com/nl/Over-de-haven/onderwijs-werk/Port-research-centre/Documents/Floating-Cranes-for-Container-Handling.pdf. last Accessed 1 April 2012
  68. Saharidis GKD, Golias MM, Boile M, Theofanis S, Ierapetritou MG (2010) The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization. Int J Adv Manuf Technol 46:377–393Google Scholar
  69. Salido MA, Rodriguez-Molins M, Barber F (2011) Integrated intelligent techniques for remarshaling and berthing in maritime terminals. Adv Eng Inform 25:435–451Google Scholar
  70. Sammarra M, Cordeau JF, Laporte G, Monaco MF (2007) A tabu search heuristic for the quay crane scheduling problem. J Sched 10:327–336MATHGoogle Scholar
  71. Shin K, Lee T (2012) Container loading and unloading scheduling for a mobile harbor system: a global and local search method. Flex Serv Manuf J 24(4) (in press), available at http://www.springerlink.com/content/1936-6590. doi: 10.1007/s10696-012-9134-7
  72. Song L, Cherrett T, Guan W (2012) Study on berth planning problem in a container seaport: using an integrated programming approach. Comput Ind Eng 62(1):119–128Google Scholar
  73. Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectrum 30:1–52CrossRefMATHGoogle Scholar
  74. Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research—a classification and literature review. OR Spectrum 26:3–49MATHGoogle Scholar
  75. Tavakkoli-Moghaddam R, Makui A, Salahi S, Bazzazi M, Taheri F (2009) An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Comput Ind Eng 56:241–248Google Scholar
  76. Theofanis S, Boile M, Golias MM (2009) Container terminal berth planning: critical review of research approaches and practical challenges. Transp Res Rec 22–28Google Scholar
  77. UNCTAD (United Nations Conference on Trade and Development) secretariat 2011 Review of Maritime Transport 2011 United Nations publication http://www.unctad.org/en/docs/rmt2011_enpdf. Accessed 26 Jan 2012
  78. Vis IFA, De Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1–16MATHGoogle Scholar
  79. Vis IFA, Van Anholt RG (2010) Performance analysis of berth configurations at container terminals. OR Spectrum 32(3):453–476CrossRefGoogle Scholar
  80. Wang Y, Kim KH (2011) A quay crane scheduling algorithm considering the workload of yard cranes in a container yard. J Intell Manuf 22:459–470Google Scholar
  81. Wang F, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42:2186–2196Google Scholar
  82. Xu D, Li CL, Leung JYT (2012a) Berth allocation with time-dependent physical limitations on vessels. Eur J Oper Res 216(1):47–56MATHMathSciNetGoogle Scholar
  83. Xu Y, Chen Q, Quan X (2012b) Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res 192(1):123–140MATHMathSciNetGoogle Scholar
  84. Zhang HP, Kim KH (2009) Maximizing the number of dual-cycle operations of quay cranes in container terminals. Comput Ind Eng 56:979–992Google Scholar
  85. Zhang L, Khammuang K, Wirth A (2008) On-line scheduling with non-crossing constraints. Oper Res Lett 36:579–583MATHMathSciNetGoogle Scholar
  86. Zhang C, Zheng L, Zhang Z, Shi L, Armstrong AJ (2010) The allocation of berths and quay cranes by using a sub-gradient optimization technique. Comput Ind Eng 58:40–50Google Scholar
  87. Zhen L, Chew EP, Lee LH (2011a) An integrated model for berth template and yard template planning in transshipment hubs. Transp Sci 45(4):483–504Google Scholar
  88. Zhen L, Lee LH, Chew EP (2011b) A decision model for berth allocation under uncertainty. Eur J Oper Res 212:54–68Google Scholar
  89. Zhou PF, Kang HG (2008) Study on berth and quay-crane allocation under stochastic environments in container terminals. Sys Eng Theory Pract 28(1):161–169Google Scholar
  90. Zhu Y, Lim A (2006) Crane scheduling with non-crossing constraint. J Oper Res Soc 57:1464–1471MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Héctor J. Carlo
    • 1
  • Iris F. A. Vis
    • 2
  • Kees Jan Roodbergen
    • 2
  1. 1. Industrial Engineering DepartmentUniversity of Puerto Rico, MayagüezMayagüezUSA
  2. 2. Department of Operations, Faculty of Economics and BusinessUniversity of GroningenGroningenThe Netherlands

Personalised recommendations