A static-hybrid berth allocation problem with multi ship crane scheduling

Abstract

The berth and quay crane allocation problem aims to determine the berthing times and positions of container ships in port container terminals. Solving this problem effectively improves the efficiency of seaside operations by optimally allocating berthing spaces and quay cranes to vessels. The problem is formulated as the berth allocation problem (BAP) with multiple ships and quay cranes (QCs) and the solution for the numerical example is presented through commercial software, known as the General Algebraic Modeling System (GAMS). The contribution of this paper is the study of the combination of static-hybrid berth allocation and crane scheduling. The paper addresses the calculation of the vessel's handling time which depends on the vessel berthing time and the unloading or loading operation of a single container. The objective is to minimize the overall processing time, defined as the latest starting time for the last vessel plus its processing time.