Publication
Title
An enriched model for the integrated berth allocation and quay crane assignment problem
Author
Abstract
Given the increasing pressure to improve the efficiency of container terminals, a lot of research efforts have been devoted to optimizing container terminal operations. Most papers deal with either the berth allocation problem (BAP) or the (quay) crane assignment problem (CAP). In the literature on the BAP, handling times are often simplified to be berth dependent or proportional to vessel size, so the CAP can be ignored when scheduling vessels. This is unsatisfactory for real-life applications because the handling time primarily depends on the number of containers to be handled and the number of cranes deployed. Only a limited number of papers deals with the combination of berth allocation and crane assignment. In these papers however, authors often have resorted to algorithmic simplifications that limit the practical use of the models. This paper presents a MILP model for the integrated BAPCAP taking into account vessel priorities, preferred berthing locations and handling time considerations. The model is used in a hybrid heuristic solution procedure that is validated on real-life data illustrating the potential to support operational and tactical decision-making.
Language
English
Source (journal)
Expert systems with applications. - New York
Publication
New York : 2011
ISSN
0957-4174
Volume/pages
38:11(2011), p. 14136-14147
ISI
000294084700070
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 18.11.2011
Last edited 10.08.2017
To cite this reference