Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem
- 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
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.
KeywordsContinuous Berth Allocation Problem Clustering Search Simulated Annealing Metaheuristics
Unable to display preview. Download preview PDF.