Clustering Search for the Berth Allocation Problem

Authors:
Rudinei Martins de Oliveira;Geraldo Regis Mauri;Luiz Antonio Nogueira Lorena
Affiliations:
National Institute for Space Research - INPE, Brazil;Federal University of Espírito Santo - UFES, Brazil;National Institute for Space Research - INPE, Brazil
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 3
Cited 1

Models and Tabu Search Heuristics for the Berth-Allocation Problem

Transportation Science
Clustering search algorithm for the capacitated centered clustering problem

Computers and Operations Research
A hybrid column generation approach for the berth allocation problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Particle swarm optimization algorithm for the berth allocation problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.05

Visualization

Abstract

This work presents a new approach to the Berth Allocation Problem (BAP) for ships in ports. Due to the increasing demand for ships carrying containers, the BAP can be considered as a major optimization problem in marine terminals. In this paper, the BAP is considered as dynamic and modeled in discrete case and we propose a new alternative to solve it. The proposed alternative is based on applying the Clustering Search (CS) method using the Simulated Annealing (SA) for solutions generation. The CS is an iterative method which divides the search space in clusters and it is composed of a metaheuristic for solutions generation, a grouping process and a local search heuristic. The computational results are compared against recent methods found in the literature.