In container terminals, the actual arrival time and handling time of a vessel often deviate
from the scheduled ones. Being the input to yard space allocation and crane planning, berth …

We consider a berth allocation problem in container terminals in which the assignment of
vessels to berths is limited by water depth and tidal condition. We model the problem as a …

This paper addresses an effective approach to solve the issue of berth allocation and quay
crane assignment in a multi-user container terminal. First of all, the studied coupling problem …

This paper provides an integrated solution for two common processes in a container
seaport: namely, the Berth Allocation Process (BAP) and the Crane Scheduling Process …

We consider a terminal operator who provides container handling services at multiple
terminals within the same port. In this setting, the well-known berth allocation problem can …

With the rapid development of container transport industry, container terminal systems have
become more and more busy. Some measures and facilities are taken to improve the …

The dynamic minimum cost berth allocation problem (BAP) is considered with an aim to
minimize the total costs of waiting and handling, as well as earliness or tardiness of …

2 instances. Three acceleration strategies are incorporated into the BD algorithm, which are
adding 1 Pareto-optimal cuts, updating big-M coefficients and generating combinatorial …

This paper proposed an integrated model of combining Berth Allocation Problems (BAP)
and Quay Cranes Assignments (QCA). It aims to improve terminal performances by …

Abstract [eng] The dissertation investigates the issues of planning problems of container
terminals' activity. The main object of the work is the technological cycle of container …