桥吊可动态分配的连续泊位分配问题算法

摘要

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.%研究在允许桥吊动态分配的情况下集装箱码头的连续泊位动态分配问题,并建立以船舶在港时间最小为目标的动态泊位分配模型;然后基于兄弟—儿子方法对船舶的位置进行调整以规划桥吊使桥吊不交叉.在相同算例下,比现有方法得到的船舶在港时间更少,从而验证了模型及算法的有效性.