loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Geraldo Regis Mauri 1 ; Larice Nogueira de Andrade 2 and Luiz Antonio Nogueira Lorena 3

Affiliations: 1 Federal University of Espírito Santo - UFES, Brazil ; 2 Federal University of Triângulo Mineiro - UFTM, Brazil ; 3 National Institute for Space Research, Brazil

ISBN: 978-989-8425-83-6

Keyword(s): Berth allocation, Memetic algorithm, Simulated annealing, Combinatorial optimization.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Art and Design ; Evolutionary Computing ; Evolutionary Multiobjective Optimization ; Genetic Algorithms ; Hybrid Systems ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing

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 litera ture and new best-known solutions are presented. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.227.240.143

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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

@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},
}

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

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.