Rescheduling Strategy for Berth Planning in Container Terminals: An Empirical Study from Korea

Abstract

The rapid increase in international trade volume has caused frequent fluctuation of the vessels’ arrival time in container terminals. In order to solve this problem, this study proposes a methodology for rescheduling berth and quay cranes caused by updated information on the arrival time of vessels. A mixed-integer linear programming model was formulated for the berth allocation and crane assignment problem, and we solved the problem using a rolling-horizon approach. Numerical experiments were conducted under three scenarios with empirical data from a container terminal located in Busan, Korea. The experiments revealed that the proposed model reduces penalty costs and overall delayed departure time compared to the results of the terminal planner.

Keywords

• container terminals
• berth allocation problem
• quay crane assignment problem
• dynamic rescheduling
• mixed-integer linear programming
• rolling-horizon approach