Genetic Algorithm for the Dynamic Berth Allocation Problem in Real Time

The container terminals (CTs) are designed to provide support to the continuous changes in the containerships. The most common schemes used for dock management are based on discrete and continuous locations. The consideration of continuous location in the CT allows arriving every container ship to the port independently of its size and dimensions. This work addresses the berth allocation problem with continuous dock, which is called dynamic berth allocation problem. We propose a mathematical model and develop a heuristic procedure based on a genetic algorithm to solve the corresponding mixed integer problem. Allocation planning aims to minimize the service time for each ship according to the berth and quay crane scheduling. Experimental analysis is carried out for the port of Algeciras that is the most important CT in Spain.

[1]  Peter Bernard Marlow,et al.  Strengths and weaknesses of short sea shipping , 2002 .

[2]  Jesper Larsen,et al.  Models for the discrete berth allocation problem: A computational comparison , 2011 .

[3]  Der-Horng Lee,et al.  Integrated discrete berth allocation and quay crane scheduling in port container terminals , 2010 .

[4]  Stefan Voß,et al.  Container terminal operation and operations research — a classification and literature review , 2004 .

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

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

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

[8]  Lei Wang,et al.  Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures , 2006 .

[9]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[10]  Matteo Salani,et al.  Modeling and Solving the Tactical Berth Allocation Problem , 2010 .

[11]  Akio Imai,et al.  Berthing ships at a multi-user container terminal with a limited quay capacity , 2008 .

[12]  Yeong-Dae Kim,et al.  Simulated annealing and genetic algorithms for scheduling products with multi-level product structure , 1996, Comput. Oper. Res..

[13]  Carlos Arango,et al.  Berth allocation planning in Seville inland port by simulation and optimisation , 2011, Adv. Eng. Informatics.

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

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

[16]  Akio Imai,et al.  The Berth Allocation Problem with Service Time and Delay Time Objectives , 2007 .

[17]  Alexandre César Muniz de Oliveira,et al.  Model and heuristic for berth allocation in tidal bulk ports with stock level constraints , 2011, Comput. Ind. Eng..

[18]  T. Notteboom.  Chapter 2 Strategic Challenges to Container Ports in a Changing Market Environment , 2006 .

[19]  Amir Hossein Alavi,et al.  Krill herd: A new bio-inspired optimization algorithm , 2012 .

[20]  Francisco Xavier Martínez Oses,et al.  Short sea shipping opportunities for the pyrenean cargo flows , 2005 .

[21]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

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

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

[24]  G. Polo,et al.  A NEW GENERATION OF CONTAINERSHIPS: CAUSE OR EFFECT OF THE ECONOMIC DEVELOPMENT? , 2006 .

[25]  Anna Sciomachen,et al.  A decomposition heuristics for the container ship stowage problem , 2006, J. Heuristics.