Computer Engineering and Applications ›› 2012, Vol. 48 ›› Issue (14): 241-248.

Previous Articles    

Research of integrated yard crane and yard truck scheduling problem

LE Meilong, BAO Jie, FAN Zhiqiang   

  1. Logistics Research Center, Scientific Research Academy, Shanghai Maritime University, Shanghai 200135, China
  • Online:2012-05-11 Published:2012-05-14

龙门吊与集卡协同调度问题研究

乐美龙,包  节,范志强   

  1. 上海海事大学 科学研究院 物流研究中心,上海 200135

Abstract: Operations of Yard Crane(YC) and operations of Yard Truck(YT) are highly interrelated in ports. The schedule of YT and YC with synchronization is effective to reduce the turnaround time of containership. Integrated YC and YT scheduling is considered in this paper. The synchronization between YC and YT is well considered. Based on this, the constraints existed in actual operations are firstly considered, such as the non-crossing constraint when several YCs share a bi-directional lane. There are other constraints, such as fixed YC separation distances, job-precedence constraints. A mathematical model is formulated to describe the problem, and the objective is to minimize the makespan. Due to the computational intractability, a method called Multi-Layer Genetic Algorithm(MLGA) is introduced to solve the model, and then computational experiments are conducted to evaluate the effectiveness of the method.

Key words: yard crane, yard truck, integrated scheduling, multi-layer genetic algorithm

摘要: 在港口码头作业中,龙门吊的作业与集卡的作业之间存在着非常紧密的联系,如何更好地同步龙门吊与集卡之间的作业,对减少集装箱船的在港时间非常有效。同时考虑了龙门吊与集卡的协同调度,很好地考虑了龙门吊与集卡之间的同步。在此基础之上,首次考虑了实际作业中存在的一些约束,如多台龙门吊在同一个箱区作业时由于共享一个双向轨道而存在的龙门吊间不能相互跨越的约束。另外还有龙门吊间的安全距离约束,工作优先约束等。构建了一个数学模型来描述问题,目标是使得所有作业总完工时间最短。由于问题计算的复杂性,引进了一种多层遗传算法来求解模型,最后算例验证了算法的有效性。

关键词: 龙门吊, 集卡, 协同调度, 多层遗传算法