The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting ...

The Berth Allocation Problem aims at assigning and scheduling incoming vessels to berthing positions along the quay of a container terminal. This problem is a well-known optimization problem within maritime shipping. For solving it, we propose two POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) approaches that incorporate an existing mathematical programmi...

With the regular development of global epidemic, port shipping supply is tight. The problem congestion, soaring freight rates, and hard-to-find container space has emerged. This paper proposes a new joint berth-quay crane allocation model, namely E-B&QC, by taking minimum time in ship, cost extra transportation distance for collector trucks land area port, waiting ships. Then, deficiencies spar...

Decision support systems and automated planning have become essential for the effective management of seaport container terminals. Due to ever-increasing levels maritime traffic freight transportation, terminals are expected facilitate their intra-yard operations while respecting tighter vessel schedules. Employed models must therefore be capable providing berth allocation decisions which not o...

Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. It has previously been applied to the TSP and QAP with encouraging results that demonstrate its potential. In this paper, we present FF-AS-SBP, an algorithm that applies ACO to the ship berthing problem (SBP), a generalization ...