A MEMETIC ALGORITHM FOR A CONTINUOUS CASE OF THE BERTH ALLOCATION PROBLEM

Geraldo Regis Mauri, Larice Nogueira de Andrade, Luiz Antonio Nogueira Lorena

2011

Abstract

This work presents a Memetic Algorithm heuristic to solve a continuous case of the Berth Allocation Problem (BAP). The BAP deals with programming and allocating ships to berthing areas along a quay. In general, the continuous case considers that ships have different lengths and can moor anywhere along the quay. However, we consider a quay divided in berths that have limited areas and different equipments to handle the ships. So, we must to assign the ships to berths and determine the berthing time and position for each ship. We treat the ships as rectangles to be placed into a space × time area avoiding overlaps and satisfying time window constraints. Our MA uses a Simulated Annealing (SA) as the local search mechanism, and SA is also applied in a stand alone way to solve the BAP. A two-phase heuristic is also presented to compute the berthing time and position for all of ships during MA and SA execution. Computational results are performed on a set of instances proposed in the literature and new best-known solutions are presented.

Paper Citation

in Harvard Style

Regis Mauri G., Nogueira de Andrade L. and Antonio Nogueira Lorena L. (2011). A MEMETIC ALGORITHM FOR A CONTINUOUS CASE OF THE BERTH ALLOCATION PROBLEM . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011) ISBN 978-989-8425-83-6, pages 105-113. DOI: 10.5220/0003636601050113

in Bibtex Style

@conference{ecta11,
author={Geraldo Regis Mauri and Larice Nogueira de Andrade and Luiz Antonio Nogueira Lorena},
title={A MEMETIC ALGORITHM FOR A CONTINUOUS CASE OF THE BERTH ALLOCATION PROBLEM},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)},
year={2011},
pages={105-113},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003636601050113},
isbn={978-989-8425-83-6},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2011)
TI - A MEMETIC ALGORITHM FOR A CONTINUOUS CASE OF THE BERTH ALLOCATION PROBLEM
SN - 978-989-8425-83-6
AU - Regis Mauri G.
AU - Nogueira de Andrade L.
AU - Antonio Nogueira Lorena L.
PY - 2011
SP - 105
EP - 113
DO - 10.5220/0003636601050113