The Tactical Berth Allocation Problem (TBAP) aims to allocate incoming ships to berthing positions andassign quay crane profiles to them (i.e. number of quay cranes per time step). The goals of the TBAPare both the minimization of the housekeeping costs derived from the transshipment container flowsbetween ships, and the maximization of the total value of the quay crane profiles assigned to the…
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 seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techni…
This paper considers the Dynamic Berth Allocation Problem, in which vessels are assigned to discrete positions in berths. This problem, whose goal is to minimize the total time the vessels stay at the port, constitutes one of the most important processes at any containers terminal. We propose a hybrid metaheuristic that combines Tabu Search with Path Relinking, T2SnþPR. The results reached by …
This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to int…