Authors:
Geraldo Regis Mauri
1
;
Larice Nogueira de Andrade
2
and
Luiz Antonio Nogueira Lorena
3
Affiliations:
1
Federal University of Espírito Santo - UFES, Brazil
;
2
Federal University of Triângulo Mineiro - UFTM, Brazil
;
3
National Institute for Space Research, Brazil
Keyword(s):
Berth allocation, Memetic algorithm, Simulated annealing, Combinatorial optimization.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Computational Intelligence
;
Evolutionary Art and Design
;
Evolutionary Computing
;
Evolutionary Multiobjective Optimization
;
Genetic Algorithms
;
Hybrid Systems
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Soft Computing
Abstract:
This work presents a Memetic Algorithm heuristic to solve a continuous case of the Berth Allocation Problem
(BAP). The BAP deals with programming and allocating ships to berthing areas along a quay. In general, the
continuous case considers that ships have different lengths and can moor anywhere along the quay. However,
we consider a quay divided in berths that have limited areas and different equipments to handle the ships. So,
we must to assign the ships to berths and determine the berthing time and position for each ship. We treat
the ships as rectangles to be placed into a space × time area avoiding overlaps and satisfying time window
constraints. Our MA uses a Simulated Annealing (SA) as the local search mechanism, and SA is also applied
in a stand alone way to solve the BAP. A two-phase heuristic is also presented to compute the berthing time
and position for all of ships during MA and SA execution. Computational results are performed on a set of
instances proposed in the liter
ature and new best-known solutions are presented.
(More)