用改进萤火虫算法求解岸桥调度模型

Solving quay crane scheduling model with improved firefly algorithms

针对集装箱码头岸桥调度问题,以集装箱箱组为切入点,综合考虑岸桥干扰约束及作业单元优先顺序约束,以最小化船舶作业时间以及岸桥作业时间为目标,建立混合整数规划模型.利用多种算法进行求解对比,并针对新颖的萤火虫算法进行研究,提出两种改进的萤火虫算法以克服其运行时间较长及易陷入局部最优的缺陷.实例分析表明,两种改进后的萤火虫算法能有效解决岸桥调度问题,其相关理论对提高岸桥的作业效率以及集装箱码头服务水平具有一定借鉴意义.

Aiming at the quay crane scheduling problem in container terminals,the container group is taken into main consideration,and the quay crane interference constraint and the handling sequence constraint for individual tasks are taken into account. In order to minimize the operation time of ships and quay cranes,a mixed integer programming model is presented. Several algorithms are used to solve the model,their comparison is carried out,and a new firefly algorithm is researched. Due to the fact that the computational time of the firefly algorithm is relatively long and it is prone to local optimum,two improved firefly algorithms are put forward. The case study shows that the two proposed algorithms can solve the quay crane scheduling problem effectively. The related theory has certain reference for improving the operational efficiency of quay cranes and the service level of container terminals.