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.
2014
2014
Over the years, the demand for maritime transportation has rapidly increased [1], [2]. This usually leads to an increasing in… 
2014
2014
The berth allocation problem (BAP), which defines a processing interval and a berth at the quay wall for each ship to be (un… 
2012
2012
Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth… 
2010
2010
Seaport container terminals are source of many interesting large-scale optimization problems, that arise in the management of… 
2010
2010
In the context of container terminal operations, the simultaneous optimization of decision problems that are usually solved… 
2009
2009
The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces… 
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… 
2007
2007
The berth-allocation problem (BAP) aims to optimally schedule and assign ships to berthing areas along a quay. In this paper the…