Skip to main content
SpringerLink
Log in

Simultaneous berth allocation and yard planning at tactical level

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

Abstract

We present a simultaneous berth allocation and yard planning problem at tactical level, since the berth allocation has a great impact on the yard planning and vice versa. This problem is solved by means of an alternating berth and yard planning heuristic approach. The alternating heuristic quickly converges to a local minimum which heavily depends on the starting point. Therefore, we formulate another optimization problem for generating a suitable starting point. A real size case study provided by PSA Antwerp shows that our approach to simultaneously solve both problems might reduce the total straddle carrier travel distance considerably as compared with a representative allocation.

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

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202:615–627

    Article  Google Scholar 

  • Brimberg J, Hansen P, Mladenović N, Salhi S (2008) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5:1–12

    Google Scholar 

  • Cooper L (1964) The transportation-location problem. SIAM Rev 6:37–53

    Article  Google Scholar 

  • Cordeau J-F, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur J Oper Res 176:1167–1184

    Article  Google Scholar 

  • Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39:526–538

    Article  Google Scholar 

  • Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B 44:232–245

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • Hendriks MPM (2009) Multi-step optimization of logistics networks strategic, tactical, and operational descisions. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.

  • 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:248–273

    Google Scholar 

  • Hendriks MPM, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectr 32:501–517

    Article  Google Scholar 

  • Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179:579–593

    Article  Google Scholar 

  • 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–221

    Article  Google Scholar 

  • Kim KH, Park KT (2003a) Dynamic space allocation for temporary storage. Int J Syst Sci 34:11–20

    Article  Google Scholar 

  • Kim KH, Park KT (2003b) A note on a dynamic space-allocation method for outbound containers. Eur J Oper Res 148:92–101

    Article  Google Scholar 

  • Kim KH, Park Y-M, Jin M-J (2008) An optimal layout of container yards. OR Spectr 30:675–695

    Article  Google Scholar 

  • Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Trans Res Part B 37:541–560

    Article  Google Scholar 

  • Lee LH, Chew EP, Tan KC, Han Y (2006) An optimization model for storage yard management in transshipment hubs. OR Spectr 28:539–561

    Article  Google Scholar 

  • Moccia L, Cordeau J-F, Monaco MF, Sammarra M (2009) A column generation heuristic for a dynamic generalized assignment problem. Comput Oper Res 36:2670–2681

    Article  Google Scholar 

  • Monaco MF, Sammarra M (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Trans Sci 41:265–280

    Article  Google Scholar 

  • Moorthy R, Teo C-P (2006) Berth management in container terminal: the template design problem. OR Spectr 28:495–518

    Article  Google Scholar 

  • Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131:282–292

    Article  Google Scholar 

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

    Google Scholar 

  • Wang FW, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42:2186–2196

    Article  Google Scholar 

  • Zhang C, Liu J, Wan Y-W, Murthy KG, Linn RJ (2003) Storage space allocation in container terminals. Trans Res Part B 37:883–903

    Article  Google Scholar 

Download references

Acknowledgments

The work of E. Lefeber is supported by the Netherlands Organization for Scientific Research (NWO-VIDI Grant 639.072.072).

Author information

Authors and Affiliations

  1. Eindhoven University of Technology, Eindhoven, The Netherlands

    M. P. M. Hendriks, E. Lefeber & J. T. Udding

Authors
  1. M. P. M. Hendriks
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Lefeber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. T. Udding
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. Lefeber.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hendriks, M.P.M., Lefeber, E. & Udding, J.T. Simultaneous berth allocation and yard planning at tactical level. OR Spectrum 35, 441–456 (2013). https://doi.org/10.1007/s00291-012-0305-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-012-0305-4

Keywords

Search

Navigation