Modeling and solving the Tactical Berth Allocation Problem

Abstract

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, which assigns to incoming ships a certain QC profile (i.e. number of quay cranes per working shift). We present two formulations: a mixed integer quadratic program and a linearization which reduces to a mixed integer linear program. The objective function aims, on the one hand, to maximize the total value of chosen QC profiles and, on the other hand, to minimize the housekeeping costs generated by transshipment flows between ships. To solve the problem we developed a heuristic algorithm which combines tabu search methods and mathematical programming techniques. Computational results on instances based on real data are presented and compared to those obtained through a commercial solver.2

A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

“…Heuristic approach for simultaneous optimization of berth and quay crane assignment has been addressed by [22], [23] and [24]. A study by [25] proposed a simulation-based Genetic Algorithm (GA) search procedure for the simultaneous berth and quay crane scheduling problem with uncertainties of vessel arrival time and container handling time.…”

An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment

“…These unrealistic assumptions are addressed by the model proposed by Giallombardo et al (2010). The joint problem, called the Tactical Berth Allocation Problem (TBAP), makes use of the concept of quay crane assignment profiles to capture real-world issues.…”

“…We consider the problem defined by Giallombardo et al (2010) for the Tactical Berth Allocation Problem.…”

A decision support system for managing combinatorial problems in container terminals

“…It minimizes the weighted number of vessel rejections. In this sense, an integration through two mixed integer programming formulations including a tabu search method is presented by Giallombardo et al [17]. The latter tabu search method is an adaption of the one of [11].…”

“…Moreover, only some works integrate the BAP with the QCAP. Giallombardo et al [17] try to minimize the yard-related house-keeping costs generated by the flows of containers exchanged between vessels. However, there also exists a relationship between the optimization of maritime and terminal-sides operations (BAP, QCAP, CStackP, etc.).…”