Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem

  • Rudinei Martins de Oliveira
  • Geraldo Regis Mauri
  • Luiz Antonio Nogueira Lorena
Conference paper

DOI: 10.1007/978-3-642-29124-1_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7245)
Cite this paper as:
de Oliveira R.M., Mauri G.R., Lorena L.A.N. (2012) Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem. In: Hao JK., Middendorf M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg

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.

Keywords

Continuous Berth Allocation Problem Clustering Search Simulated Annealing Metaheuristics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rudinei Martins de Oliveira
    • 1
  • Geraldo Regis Mauri
    • 2
  • Luiz Antonio Nogueira Lorena
    • 1
  1. 1.National Institute for Space Research - INPESão José dos CamposBrazil
  2. 2.Federal University of Espírito Santo - UFESAlegreBrazil

Personalised recommendations