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 addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-e€ectiveness in Japan's ports. The berth allocation to calling ships is a key factor for ecient public berthing. However, it is not calculated in polynomially-...

A marine container terminal operator may have a situation with excessive calling requests to be served especially when some new service contracts are under consideration. For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arranges their berth-windows within a limited planning horizon. The BTPS employs the su...

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...

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 ...

One of the foremost planning problems in container transshipment operation concerns the allocation of home berth (preferred berthing location) to a set of vessels scheduled to call at the terminal on a weekly basis. The home berth location is subsequently used as a key input to yard storage, personnel, and equipment deployment planning. For instance, the yard planners use the home berth templat...

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 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...

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...

Genetic Algorithm which is based on the Darwinian principle of natural selection has been successfully applied to Berth allocation problem (BAP), which can decide the ships’ berthing position and berthing time at a container terminal. Considering the service priority, handing time deciding variables, safety clearance, as well as the berths’ physical conditions, a dynamic berth allocation with d...