Abstract:

In order to realize the dynamic adjustment and optimization of quay crane operation plan，and enhance the operation efficiency at the automated terminal, the quay crane of whole shoreline is taken as the research object. Dividing the shoreline into bay units, considering safety distance, operation sequence and the tasks of bay during the operation of quay crane, the goal is to minimize the maximum completion time and waiting time of the quay crane. A mixed integer programming model is established and solved by designing genetic algorithm. The model and algorithm are verified through practical examples in different situations. The results show that this model can effectively solve the problem of quay crane scheduling on the whole shoreline and obtain better decision plan. At the same time, with the expansion of the example, the calculation time of the improved genetic algorithm decreases and the quality of the solution is higher, which shows that the quay crane dispatching on the whole shoreline can improve the efficiency of automated terminal operations.

Key words: quay crane scheduling, interference constraints, safe distance, Genetic Algorithm（GA）

摘要：

为实现自动化码头岸桥作业方案的动态调整与优化，提升作业效率，以全岸线的岸桥为研究对象，在岸线以贝位为单位划分的基础上，考虑岸桥装卸作业过程中的安全距离、作业顺序以及贝位任务量等因素，建立了以最小化岸桥最大完工时间和等待时间为目标的混合整数规划模型，并设计了改进的遗传算法对该模型进行求解。通过不同情形的实际算例对模型和算法进行了验证。计算结果表明，该模型可以有效解决全岸线的岸桥调度问题，并得到更优的调度结果；同时改进的遗传算法计算时间随着算例规模的扩大而减少，并且解的质量更高，进而验证了在提升自动化码头作业效率上，全岸线岸桥调度的有效性。

关键词: 岸桥调度, 干扰约束, 安全距离, 遗传算法（GA）