Berth Allocation and Crane Assignment Problem in Continuous Berth Containers Vessels Terminals

Abstract

This research addresses the problem of optimizing simultaneously the container vessels berthing schedule and quay cranes assignment for each berthed container vessel. A mixed integer linear programming (MILP) mathematical model is developed to achieve the lowest total flow time of the group of anchored vessels waiting for service, considering port resources usage constraints. The research extended to study the efficiency of the use of port resources such as berth length, number of available quay cranes in the port and the maximum allowable quay cranes that can serve a vessel. Experiments were carried out using the developed model to study the effect of number of quay cranes, berth length and the maximum allowable cranes per vessel on vessels total flow time as well as the interaction between these factors in affecting the total flow time. The utilization of berth and quay cranes were studied at the berthing schedule that minimizes the total flow time. It was concluded from the results that increasing the number of quay cranes will not contribute to improving the total vessel flow time unless a sufficient berth that can accommodate more vessels is present. Moreover, a reduced quay crane utilization will occur with increasing the number of quay cranes. Also, increasing the maximum allowable quay cranes for vessels in service contribute to improving vessels total flow time and quay carne utilization.

Keywords

• berth scheduling
• continuous berth
• quay crane
• ports scheduling