基于模拟退火算法的场桥调度研究

Research on yard crane scheduling problem based on simulated annealing algorithm

集装箱码头的运作效率受场桥调度作业的影响很大,场桥调度合理与否对集装箱码头的整体运作效率具有至关重要的影响。高效的场桥调度方案不仅要满足给定配载计划下的种类和数量需求,而且要最小化场桥行走距离。为确定场桥的行走顺序和取箱方案,建立了以总完成时间最短为目标的场桥装载调度作业混合整数规划模型。分别运用启发式算法和模拟退火算法,对模型进行求解,并通过算例分析验证了算法及模型,表明模拟退火算法的结果要优于启发式算法,如当堆场数量为55个时,模拟退火算法要比启发式算法节约46 min,随着贝和集装箱类型的增加,模拟退火算法可节约更多的时间,同时还减少了龙门吊行走的路径,从而有效地提高了集装箱码头的运营效率。

The operational efficiency ling. Whether yard crane scheduling of container terminal is greatly affected by yard crane schedu- is reasonable or not is of vital to the overall operational efficien- cy of container terminal. The efficient crane scheduling scheme is not only to satisfy the species and quantity demand of a given stowage plan, but also to minimize the yard crane walking distance. In order to determine the walking sequence and box-taking scheme of the yard crane, the paper is established with the shortest total completion time as the goal of the mixed integer programming model of yard crane scheduling problem. The model is solved separately by using heuristic algorithm and a simulated annealing algorithm with the cases to prove the method right. When the bays are 55, the time can save 46 minutes by suing simulated annealing algorithm than by using heuristic algorithm. And if the number of bay and the container type increase, simulated annealing algorithm can save more time and reduce the gantry crane traveling path to improve the efficiency of the yard operation.