基于混合算法的单堆垛机多巷道拣选作业调度研究

Order Picking Scheduling in Multiple Aisles by Single Stacker Based on Hybrid Algorithm

针对单堆垛机在多巷道自动化仓库中的拣选路径规划问题,建立了求解含周转箱约束的堆垛机拣选作业最短路径数学模型,提出用遗传模拟退火混合算法进行求解。通过Matlab分别对不同算法进行实例仿真,结果表明:该混合算法克服了遗传算法早熟,以及模拟退火算法收敛性慢的缺点,求出的解更优,收敛速度更快,稳定性更好。该混合算法具有可行性和高效性。

To solve order picking path planning problem with a stacker in AS/RS of multi aisles, a mathe- matical model is established in order to minimize the total running distance of stacker for some given orders considering the constraints of turnover box capacity for stacker. Then the model is solved using a new algo- rithm combining GA with SA. Finally, for a same application case, GA, SA and hybrid algorithm of SA and GA are designed and simulated in Matlab environment. The results illustrate that the hybrid algorithm overcomes the prematurity of GA （ Genetic Algorithm） and the slow convergence speed of SA （ Simulated Annealing）. The result of the proposed approach is more accurate, more stable and faster in convergence than a single algorithm. The hybrid algorithm proves feasible and efficient.