An Algorithm for Continuous Berth Allocation with Quay Crane Dynamic Allocation

In this paper, we study the continuous berth allocation problem for the container terminals with assumption of quay crane being dynamically allocated and propose new berth allocation model. Based on brother-son method, we develop algorithm to solve the berth allocation problem with presetting the position of the vessels and quay crane being dynamically allocated in the right position without crossing. Computing experiments show that our model and algorithm are more efficient.