煤炭堆场空间调度的GRASP算法研究

Research on Greedy Random Adaptive Search Procedure Algorithm for the Scheduling of Coal Stockyard Space

煤炭堆场调度问题往往是港口作业的瓶颈环节,为了提高堆场空间的利用率,采用随机贪婪自适应搜索(GRASP)算法,由BL算法确定煤堆矩形的位置,对煤堆矩形的位置进行修复使之满足煤堆矩形之间的位置约束,通过实验研究GRASP算法中贪婪函数、贪婪参数对算法性能的影响,并将GRASP算法与约束规划(CP)进行对比实验。实验结果表明:GRASP算法在数据规模较大时能以更快的速度求得满意解,且具有较好的鲁棒性。

Coal stockyard scheduling problem is often the bottleneck of port operations.In order to improve the efficiency of stockyard space,a greedy random adaptive search procedure(GRASP)algorithm is adopted,which uses the Bottom Left algorithm to determine the position of the rectangular coal stockpile,and the position of rectangular coal stockpiles is improved to satisfy the position constraint between the rectangular coal stockpiles.Through experimental research,the effects of the greedy function and the greedy parameters on the performance of the greedy random adaptive search procedure algorithm are analyzed.Experiments are carried out to compare the performance of the constrained programming(CP)with the GRASP algorithm on the solving of coal stockyard scheduling problem.The experimental results show that GRASP algorithm can find a satisfactory solution at a faster speed when the data size is large,and it has good robustness.