Show simple item record

A genetic algorithm for berth allocation and quay crane assignment

dc.contributor.authorRodríguez Molins, Mario
dc.contributor.authorBarber, Federico
dc.contributor.authorSierra Sánchez, María Rita 
dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorSalido, Miguel A.
dc.description13th Ibero-American Conference on Artificial Intelligence. IBERAMIA 2012, Cartagena de Indias, Colombia. 13-16 November 2012spa
dc.descriptionThe final publication is available at Springer via
dc.description.abstractContainer terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a berthing position, a mooring time and a number of Quay Cranes. This problem is known as the Berthing Allocation and Quay Crane Assignment problem. To formulate the problem, we first propose a mixed integer linear programming model to minimize the total weighted service time of the incoming vessels. Then, a meta-heuristic algorithm (Genetic Algorithm (GA)) is presented for solving the proposed problem. Computational experiments are performed to evaluate the effectiveness and efficiency of the proposed methodspa
dc.description.sponsorshipThis research has been supported by the Spanish Government under research project MICINN TIN2010-20976-C02-01 and TIN2010- 20976-C02-02, and the predoctoral FPU fellowship (AP2010-4405)spa
dc.format.extentp. 601-610spa
dc.relation.ispartofAdvances in Artificial Intelligence, IBERAMIA 2012spa
dc.rights© Springer
dc.rightsCC Reconocimiento - No comercial - Sin obras derivadas 4.0 Internacional
dc.subjectGenetic algorithmsspa
dc.subjectBerthing allocationspa
dc.subjectQuay crane assignmentspa
dc.titleA genetic algorithm for berth allocation and quay crane assignmenteng
dc.typeconference outputspa
dc.relation.projectIDMEC/TIN2010- 20976-C02-02
dc.rights.accessRightsopen accessspa

Files in this item


This item appears in the following Collection(s)

Show simple item record

© Springer
This item is protected with a Creative Commons License