A Note on Formulations of Static and Dynamic Berth Allocation Problems

The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of their waiting and cargo handling times. In the static case, ships are assumed to arrive before the berths become available; in the dynamic case they can arrive before or after. We discuss recent models for both problems, correct one formulation, and provide a compact reformulation for the dynamic case. The computational results for problems that are moderate in size but realistic, with up to 10 berths and 50 ships, using both formulations and CPLEX, are reported.

[1]  Dimitri P. Bertsekas,et al.  Auction algorithms for network flow problems: A tutorial introduction , 1992, Comput. Optim. Appl..

[2]  Rommert Dekker,et al.  Operations research supports container handling , 2001 .

[3]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

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

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

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

[7]  西村 悦子,et al.  Berth Allocation Planning in the Public Berth System by Genetic Algorithms , 2000 .

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

[9]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[10]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[11]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[12]  John J. H. Forrest,et al.  Practical Solution of Large Mixed Integer Programming Problems with Umpire , 1974 .

[13]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

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

[15]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[16]  Carlos F. Daganzo,et al.  A branch and bound solution method for the crane scheduling problem , 1990 .