Clustering Search Heuristic for Solving a Continuous Berth Allocation Problem
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.
- 16.Li, C.L., Cai, X., Lee, C.Y.: Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30, 433–445 (1998)Google Scholar
- 19.Mauri, G.R., Andrade, L.N., Lorena, L.A.N.: A memetic algorithm for a continuous case of the berth allocation problem. In: ECTA 2011 - International Conference on Evolutionary Computation Theory and Applications, Paris, France (2011)Google Scholar
- 20.Monaco, M.F., Sammarra, M.: The berth allocation problem: a strong formulation solved by a lagrangean approach. Transportation Research Part B 41(2), 265–280 (2007)Google Scholar
- 22.Oliveira, A.C.M., Lorena, L.A.N.: Hybrid evolutionary algorithms and clustering search. SCI, vol. 75, pp. 77–99 (2007)Google Scholar
- 25.Thurman, K.P.: Optimal ship berthing plans. Dissertation (Masters of Science in Operations Research) - Naval Postgraduate School, Monterey, California - EUA (1989)Google Scholar
- 26.UNCTAD: Review of maritime transport. United Nations conference on trade and development (2010)Google Scholar