Clustering search heuristic for solving a continuous berth allocation problem

Authors:
Rudinei Martins de Oliveira;Geraldo Regis Mauri;Luiz Antonio Nogueira Lorena
Affiliations:
National Institute for Space Research - INPE, São José dos Campos, SP, Brazil;Federal University of Espírito Santo - UFES, Alegre, ES, Brazil;National Institute for Space Research - INPE, São José dos Campos, SP, Brazil
Venue:
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2012

Citing 7
Cited 1

Models and Tabu Search Heuristics for the Berth-Allocation Problem

Transportation Science
The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach

Transportation Science
A hybrid column generation approach for the berth allocation problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Hybrid evolutionary algorithm for the Capacitated Centered Clustering Problem

Expert Systems with Applications: An International Journal
Model and heuristic for berth allocation in tidal bulk ports with stock level constraints

Computers and Industrial Engineering
The berth planning problem11This research is part of a project the author has with the Port of Singapore Authority. The author was a senior technical consultant in that project. This research was supported in part by the NUS Research Front RP3972679.

Operations Research Letters
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

Particle swarm optimization algorithm for the berth allocation problem

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the increasing demand for ships carrying containers, the Berth Allocation Problem (BAP) can be considered as a major optimization problem in marine terminals. In this context, we propose a heuristic to solve a continuous case of the BAP. This heuristic is based on the application of the Clustering Search (CS) method with the Simulated Annealing (SA) metaheuristic. The results obtained by CS are compared to other methods found in the literature and its competitiveness is verified.