Paper Info
Title
Clustering search heuristic for solving a continuous berth allocation problem
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.
Year
DOI
Venue
2012
10.1007/978-3-642-29124-1_5
EvoCOP
Keywords
Field
DocType
clustering search heuristic,marine terminal,berth allocation problem,continuous case,clustering search,increasing demand,major optimization problem,simulated annealing,continuous berth allocation problem
Simulated annealing,Mathematical optimization,Heuristic,Berth allocation problem,Computer science,Cluster analysis,Optimization problem,Metaheuristic
Conference
Citations 
PageRank 
References 
6
0.47
13
Authors
3
Name
Order
Citations
PageRank
Rudinei Martins de Oliveira1312.06
Geraldo Regis Mauri2888.79
Luiz Antonio Nogueira Lorena349836.72