In this paper we consider the problem of allocating arriving ships to discrete berth locations
at container terminals. This problem is recognized as one of the most important processes …

The berth allocation problem is one of the most relevant logistics problems arising in the
management of container ports. Depending on assumptions made on the berthing location …

This paper extends the study of the continuous Berth Allocation Problem to the case of
multiple quays, which is found in many container terminals around the world. Considering …

The berth allocation problem is to allocate berths (ie, sections of the quayside) to ships
arriving in a container port in order to minimize the sum of their waiting and cargo handling …

This paper addresses the Berth Allocation Problem under Time-Dependent Limitations. Its
goals are to allocate and schedule the available berthing positions for the container vessels …

Most of the operational problems in container terminals are strongly interconnected. In this
paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in …

Berth allocation is essential for efficient terminal utilization in container ports, especially
those in Asia. This paper is concerned with a berth allocation problem (BAP) that minimizes …

In this paper, we study the dynamic hybrid berth allocation problem in bulk ports with the
objective to minimize the total service times of the vessels. We propose two exact methods …

Port terminals processing large cargo vessels play an important role in bulk material supply
chains. This paper addresses the question of how to allocate vessels to a location on a berth …

The optimal usage of berths plays a key role in raising the efficiency of container terminals.
The berth allocation problem in a container terminal is defined as the feasible allocation of …