堆场龙门吊调度问题研究

Research of container yard crane scheduling problem

在集装箱码头作业中,龙门吊是非常重要的码头资源,如何更合理地调度龙门吊对减少船舶在港时间,提高码头效率有重要意义。在综合考虑龙门吊在时间和空间上的不可跨越性以及其他约束条件的基础上,建立了龙门吊调度问题的混合整数规划模型,目标是使得集卡的等待时间最短。由于问题计算的复杂性,引进遗传算法来求解模型;算例验证了算法的有效性,与已有的模型进行比较,证明了该模型的优越性。

Yard crane is the very important resource in container terminal. How to schedule the yard crane is very important to reduce the turnaround time of containership and improve terminal efficiency. Based on integrally considering the interference between two yard cranes with overlap-ping time and other constraints, a mixed integer programming model for yard crane scheduling is built in order to minimize the waiting time of the truck. Due to the computational intractability, a method called Genetic Algo- rithm is introduced to solve the model. According to example analysis, performability of the method is verified, and compared with the existing model, the superiority of this model is proved.