Models for the discrete berth allocation problem: A computational comparison

In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe three main models of the discrete dynamic berth allocation problem, improve the performance of one model, and, through extensive numerical tests, compare all models from a computational perspective. The results indicate that a generalized set-partitioning model outperforms all other existing models.

[1]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[2]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[3]  G. Mitra,et al.  Computer Scheduling of Public Transport , 1982 .

[4]  Akio Imai,et al.  Berth allocation with service priority , 2003 .

[5]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[6]  A. Abayasekara.  Book Review: United Nations Conference on Trade and Development (UNCTAD), Commonwealth Secretariat and the Centre for WTO Studies , 2012 .

[7]  Akio Imai,et al.  Marine container terminal configurations for efficient handling of mega-containerships , 2013 .

[8]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[9]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .

[10]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[11]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[12]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003, OR Spectr..

[13]  Jim Dai,et al.  Berth Allocation Planning Optimization in Container Terminal , 2003 .

[14]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .

[15]  Youfang Huang,et al.  A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning , 2009, Comput. Ind. Eng..

[16]  Michel Bierlaire,et al.  Exact and heuristic methods to solve the berth allocation problem in bulk ports , 2013 .

[17]  Yoji Kajitani,et al.  Rectangle-packing-based module placement , 1995, ICCAD.

[18]  Chung-Piaw Teo,et al.  Berth Allocation Planning Optimization in Container Terminals , 2008 .

[19]  Chin-Sheng Chen,et al.  An analytical model for the container loading problem , 1995 .

[20]  Hidetoshi Onodera,et al.  Branch-and-bound placement for building block layout , 1991, 28th ACM/IEEE Design Automation Conference.

[21]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004, OR Spectr..

[22]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[23]  Chung-Lun Li,et al.  Berth allocation with time-dependent physical limitations on vessels , 2012, Eur. J. Oper. Res..

[24]  Pierre Hansen,et al.  Variable neighborhood search for minimum cost berth allocation , 2003, Eur. J. Oper. Res..

[25]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[26]  Qiang Meng,et al.  Liner ship fleet deployment with container transshipment operations , 2012 .

[27]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[28]  Andrew Lim,et al.  Ant Colony Optimization for the Ship Berthing Problem , 1999, ASIAN.

[29]  Richard Y. K. Fung,et al.  Berth allocation considering fuel consumption and vessel emissions , 2011 .

[30]  Alexandre César Muniz de Oliveira,et al.  A Hybrid Column Generation Approach for the Berth Allocation Problem , 2008, EvoCOP.

[31]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[32]  Maria Flavia Monaco,et al.  The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach , 2007, Transp. Sci..

[33]  Gilbert Laporte,et al.  Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..

[34]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[35]  Akio Imai,et al.  The simultaneous berth and quay crane allocation problem , 2008 .

[36]  Akio Imai,et al.  Efficient planning of berth allocation for container terminals in Asia , 1997 .