In this study, the discrete and dynamic problem of berth allocation in maritime terminals, is
investigated. The suggested resolution method relies on a paradigm of optimization with two …

The berth scheduling problem deals with the assignment of vessels to berth space in a
container terminal. Defining berth schedules in container terminal operations translates in …

Berth allocation is one of the crucial points for efficient management of ports. This problem is
complex due to all possible combinations for assigning ships to available compatible berths …

This work presents a new approach to the Berth Allocation Problem (BAP) for ships in ports.
Due to the increasing demand for ships carrying containers, the BAP can be considered as a …

This paper considers the Dynamic Berth Allocation Problem, in which vessels are assigned
to discrete positions in berths. This problem, whose goal is to minimize the total time the …

Abstract The Minimum Cost Hybrid Berth Allocation problem is defined as follows: for a
given list of vessels with fixed handling times, the appropriate intervals in berth and time …

The berth allocation problem (BAP) arising in maritime container terminals has received
great attention in the literature over recent years. It has been largely modeled as an integer …

SURVEY METAHEURISTIC APPROACHES FOR THE BERTH ALLOCATION PROBLEM Page 1
Yugoslav Journal of Operations Research 27 (2017), Number 3, 265–289 DOI …

This work focuses on comparing the performance of three well known metaheuristics for
determining the best berthing sequence in terms of minimization of total penalty cost when …

The increasing volume of maritime freight is presented as a challenge to those skilled
terminal managers seeking to maintain or increase their market share. In this context, an …