Variable Neighborhood Search Methods for the Dynamic Minimum Cost Hybrid Berth Allocation Problem

Nataša Kovač; Tatjana Davidović; Zorica Stanimirović

doi:10.5755/j01.itc.47.3.20420

Authors

Nataša Kovač University of Donja Gorica
Tatjana Davidović Mathematical Institute of the Serbian Academy of Science and Arts, Kneza Mihaila 36, 11000 Belgrade, Serbia
Zorica Stanimirović Faculty of Mathematics, University of Belgrade, Studentski trg. 16/IV, 11 000 Belgrade, Serbia

DOI:

https://doi.org/10.5755/j01.itc.47.3.20420

Keywords:

container terminal, scheduling vessels, penalties, metaheuristics, variable neighborhood search

Abstract

This study considers the Dynamic Minimum Cost Hybrid Berth
Allocation Problem (DMCHBAP) with fixed handling times of vessels.
The objective function to be minimized consists of three
components: the costs of positioning, waiting, and tardiness of
completion for all vessels. Having in mind that the speed of
finding high-quality solutions is of crucial importance for
designing an efficient and reliable decision support system in
container terminal, metaheuristic methods represent the natural
choice to deal with DMCHBAP. Four variants of Variable
Neighborhood Search (VNS) metaheuristic are designed for DMCHBAP.
All four proposed VNS methods are evaluated on three classes
of randomly generated instances with respect to solution quality and running times.
The conducted computational
analysis indicates that all four VNS-based methods represent
promising solution approaches to DMCHBAP and similar problems in
maritime transportation.

DOI: http://dx.doi.org/10.5755/j01.itc.47.3.20420