中文摘要：

针对集装箱码头泊位确定条件下的单船岸桥（QC）分配和调度问题,建立了线性规划模型。模型以船舶在泊作业时间最短为目标,考虑多岸桥作业过程中的干扰等待时间与岸桥间的作业量均衡,并设计了嵌入解空间切割策略的改进蚁群优化（IACO）算法进行模型求解。实验结果表明：与可用岸桥全部投放使用的方法相比,所提模型与算法求得结果平均能够节省31.86%的岸桥资源;IACO算法与Lingo求得的结果相比,船舶在泊作业时间的平均偏差仅为5.23%,但CPU处理时间平均降低了78.7%,表明了所提模型与算法的可行性和有效性。

英文摘要：

This paper proposed a liner programming model to deal with the Quay Crane（ QC） allocation and scheduling problem for single ship under the circumstance of fixed berth allocation. With the aim of minimizing the working time of the ship at berth, the model considered not only the disruptive waiting time when the quay cranes were working, but also the workload balance between the cranes. And an Improved Ant Colony Optimization（ IACO） algorithm with the embedding of a solution space split strategy was presented to solve the model. The experimental results show that the proper allocation and scheduling of quay cranes from the model in this paper can averagely save 31. 86% of the crane resource compared with full application of all available cranes. When comparing to the solution solved by Lingo, the results from IACO algorithm have an average deviation of 5. 23%, while the average CPU（ Central Processing Unit） computational time is reduced by 78. 7%,which shows the feasibility and validity of the proposed model and the algorithm.