|
Title
|
|
|
|
A dynamic discrete berth allocation problem for container terminals
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In recent years, improving the process of loading and unloading ships has been the subject of much attention from the terminals operators. The importance of this issue encouraged engineers to design the best simulation for a particular model to reduce time and, subsequently, the costs of the process. The study investigates the Dynamic Berth Allocation Problem (DBAP), in which vessels are assigned to discrete positions based on their length in order to minimize vessels waiting time and berth idle time. We analysed the model by employing two highly effective meta-heuristics in the form of Local Search and Population based methods to obtain optimal solutions subject to the Variable Neighbourhood Search concept (VNS) and Genetic Algorithm (GA), respectively, and compared to each other. The results obtained through an extensive numerical analysis showed that the GA performs better than VNS to this kind of problem. In contrast, with respect to runtime in the same number of iteration, VNS shows the increase in runtime is much lower when problem size rise compared to GA. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (book)
|
|
|
|
Maritime-Port Technology and Development : proceedings of the Conference On Maritime-Port Technology (MTEC 2014), 27-29 October, 2014, Trondheim, Norway
|
|
|
Publication
|
|
|
|
Boca Raton
:
CRC Press
,
2015
|
|
|
ISBN
|
|
|
|
978-1-315-73162-9
978-1-138-02726-8
|
|
|
DOI
|
|
|
|
10.1201/B17517-3
|
|
|
Volume/pages
|
|
|
|
p. 11-18
|
|
|
ISI
|
|
|
|
000380500200002
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|