Name
Abstract | ||
|---|---|---|
This work presents a new approach to the Berth Allocation Problem (BAP) for ships in ports. Due to the increasing demand for ships carrying containers, the BAP can be considered as a major optimization problem in marine terminals. In this paper, the BAP is considered as dynamic and modeled in discrete case and we propose a new alternative to solve it. The proposed alternative is based on applying the Clustering Search (CS) method using the Simulated Annealing (SA) for solutions generation. The CS is an iterative method which divides the search space in clusters and it is composed of a metaheuristic for solutions generation, a grouping process and a local search heuristic. The computational results are compared against recent methods found in the literature. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.eswa.2011.11.072 | Expert Syst. Appl. |
Keywords | DocType | Volume |
berth allocation problem,clustering search,proposed alternative,search space,new alternative,solutions generation,local search heuristic,new approach,iterative method,recent method,metaheuristics,simulated annealing | Journal | 39 |
Issue | ISSN | Citations |
5 | 0957-4174 | 20 |
PageRank | References | Authors |
0.86 | 5 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rudinei Martins de Oliveira | 1 | 31 | 2.06 |
| Geraldo Regis Mauri | 2 | 88 | 8.79 |
| Luiz Antonio Nogueira Lorena | 3 | 498 | 36.72 |
| de OliveiraRudinei Martins | 4 | 20 | 0.86 |
| MauriGeraldo Regis | 5 | 25 | 1.30 |
| Nogueira LorenaLuiz Antonio | 6 | 20 | 0.86 |