Skip to search formSkip to main contentSkip to account menu

Berth allocation problem

The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This work presents a Memetic Algorithm heuristic to solve a continuous case of the Berth Allocation Problem (BAP). The BAP deals… 
2017
2017
The increasing tendency of container vessel enlargement and the container transportation growth, make people pay more and more… 
2014
2014
Over the years, the demand for maritime transportation has rapidly increased [1], [2]. This usually leads to an increasing in… 
2014
2014
This paper explores the impact of berth allocation problem (BAP) solving depending on different options for river port design… 
2013
2013
The ports of the northern Adriatic are ranged in three countries. Koper's is the only one in Slovenia and therefore of… 
2010
2010
Seaport container terminals are source of many interesting large-scale optimization problems, that arise in the management of… 
2009
2009
This paper studies a multi-objective instance of the berth allocation problem (BAP). The BAP involves the determination of exact… 
2008
2008
In this paper we integrate two decision problems arising in container terminals: the berth allocation problem, which consists of… 
2007
2007
The purpose of this article is to verify the available scientific research in one of the prevalent problems associated with port…