Algorithm for continuous berth allocation based on dynamically allocated quay crane

Abstract

In this paper,the authors studied the continuous berth allocation problem for the container terminals with assumption of quay crane being dynamically allocated and establish a dynamic berth allocation scheme for minimizing vessel's time in port.Based on brother-son method,an algorithm was developed 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.In comparison to the existing method,the method can reduce the vessel's time with the same example,which show that the proposed model and algorithm are more efficient.