Heuristics for the integration of crane productivity in the berth allocation problem

Due to growth in the world trade, the number of containers and container vessels has been rising for decades. This challenges container terminals to make more efficient berthplans. In particular assigning berth locations and quay cranes to arriving vessels is important to run the container terminal as efficiently as possible. In this paper the berth allocation problem and the quay crane assignment problem are studied simultaneously. The results show that the studied heuristics provide good solutions for the berth and quay problems within a reasonable computation time.