Metaheuristic Approaches for the Berth Allocation Problem
Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 265
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Berth Allocation Problem incorporates some of the most important decisions
that have to be made in order to achieve maximum efficiency in a port. Terminal man-
ager of a port has to assign incoming vessels to the available berths, which need to be
loaded/unloaded in such a way that some objective function is optimized. It is well known
that even simpler variants of Berth Allocation Problem are NP-hard, and thus, metaheuris-
tic approaches are more convenient than exact methods since they provide high quality
solutions in reasonable computational time. Metaheuristics are general frameworks used
to build heuristic algorithms for hard optimization problems. In this paper, an overview
of promising and widely used metaheuristic methods in solving different variants of Berth
Allocation Problem is presented.
Classification :
90-02, 90B80, 68W20
Keywords: Container Terminal, Assignment of Vessels, Heuristic Optimization, High Quality sub-optimal Solutions
Keywords: Container Terminal, Assignment of Vessels, Heuristic Optimization, High Quality sub-optimal Solutions
@article{YJOR_2017_27_3_a0,
author = {Nata\v{s}a Kova\v{c}},
title = {Metaheuristic {Approaches} for the {Berth} {Allocation} {Problem}},
journal = {Yugoslav journal of operations research},
pages = {265 },
year = {2017},
volume = {27},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a0/}
}
Nataša Kovač. Metaheuristic Approaches for the Berth Allocation Problem. Yugoslav journal of operations research, Tome 27 (2017) no. 3, p. 265 . http://geodesic.mathdoc.fr/item/YJOR_2017_27_3_a0/