Metaheuristic approaches for the Berth Allocation Problem

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 manager 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 func...

Full description

Saved in:

Bibliographic Details
Published in:	Yugoslav Journal of Operations Research Vol. 27; no. 3; pp. 265 - 289
Main Author:	Kovač Nataša
Format:	Journal Article
Language:	English
Published:	University of Belgrade 01-01-2017
Subjects:	assignment of vessels container terminal heuristic optimization high quality sub-optimal solutions
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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 manager 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, metaheuristic 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.
ISSN:	0354-0243 1820-743X
DOI:	10.2298/YJOR160518001K