Evolutionary Computation in Combinatorial Optimization

Volume 7245 of the series Lecture Notes in Computer Science pp 49-62

Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

  • Rudinei Martins de OliveiraAffiliated withNational Institute for Space Research - INPE
  • , Geraldo Regis MauriAffiliated withFederal University of Espírito Santo - UFES
  • , Luiz Antonio Nogueira LorenaAffiliated withNational Institute for Space Research - INPE

* Final gross prices may vary according to local VAT.

Get Access


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.


Continuous Berth Allocation Problem Clustering Search Simulated Annealing Metaheuristics