A heuristics-based solution to the continuous berth allocation and crane assignment problem

• Main Authors: Mohammad Hamdy Elwany, Islam Ali, Yasmine Abouelseoud
• Format: Article
• Language: English
• Published: Elsevier 2013-12-01
• Series: Alexandria Engineering Journal
• Subjects: Container Terminal (CT); Berth Allocation Problem (BAP); Quay Crane Assignment Problem (QCAP); Simulated Annealing (SA)
• Online Access: http://www.sciencedirect.com/science/article/pii/S1110016813000896

Effective utilization plans for various resources at a container terminal are essential to reducing the turnaround time of cargo vessels. Among the scarcest resources are the berth and its associated cranes. Thus, two important optimization problems arise, which are the berth allocation and quay crane assignment problems. The berth allocation problem deals with the generation of a berth plan, which determines where and when a ship has to berth alongside the quay. The quay crane assignment problem addresses the problem of determining how many and which quay crane(s) will serve each vessel. In this paper, an integrated heuristics-based solution methodology is proposed that tackles both problems simultaneously. The preliminary experimental results show that the proposed approach yields high quality solutions to such an NP-hard problem in a reasonable computational time suggesting its suitability for practical use.