Due to the continuously increasing container trade, many terminals are presently operating at or close to capacity. An efficient terminal is one that facilitates the quick transshipment of containers to and from ships. In this sake, this paper addresses the ship assignments problem at a maritime container terminal, where ships are normally assigned to specific quay cranes until the work is fini...

This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous...

Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading per...

In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for continuous berth allocation problem (CBAP) considering tide time window. We aimed minimize total waiting time, consumption and deviation preference. overcome influence of an uncertai...

Large costs arise at a seaport container terminal from the duration of the unloading of vessels and from the time a vessel is waiting to be unloaded. The optimal allocation of vessels to berth space (Berth Allocation Problem) becomes more and more important as its solution is also input to further terminal decision problems. We compare solutions for a realistic data Berth Allocation Problem fou...

This paper studies a short-term berth allocation problem encountered in the Baoshan Iron and Steel complex. A mathematical model is developed for the problem to minimize the total tardiness particularly considering special industrial characteristics. A lower bound derived by performing a Lagrangian relaxation, along with appropriate branching rules, is incorporated into a branch and bound algor...

This paper treats a berth allocation problem in dedicated container terminals where feeder ships and container vessels are jointly served. When assigning quay space and a service time to each calling ship particular focus is put on the container exchange between feeder ships and vessels, so that the weighted number of containers delivered by feeder missing their intended vessel is minimized. Th...

Berth allocation is the forefront operation performed when ships arrive at a port and is a critical task in container port optimization. Minimizing the time ships spend at berths constitutes an important objective of berth allocation problems. This study focuses on the discrete dynamic berth allocation problem (discrete DBAP), which aims to minimize total service time, and proposes an iterated ...

Container terminals are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The consideration of continuous location in the container terminal is a go...