立体仓库固定货架拣选路径优化的蚁群算法研究  

Study on Order-picking Route Optimization forFixed Shelves with Ant Colony Algorithm

作　　者：蔺媛媛[1] 刘云[1] 

机构地区：[1]天津工程师范学院计算与语音中心,天津300222

出　　处：《中国西部科技》2010年第11期12-14,共3页Science and Technology of West China

摘　　要：本文详细分析了各类蚁群算法及其参数,将这些算法结合立体仓库固定货架拣选路径问题,选取出适合实际情况的算法模块;根据算法特性提出了根据迭代次数自适应调整q0参数和使用精英策略更新信息素两项优化等策略并通过仿真试验证实其优化性。在分析基础之上提出新蚁群算法的数学模型,通过大量仿真试验,得证新算法可以在较短的时间内找到较优的拣选路径,应用到实际操作中极大提高了立体仓库的使用效率。The paper analyzes Ant Colony Algorithm and its parameters.Based on Ant Colony Algorithm,the most suitable algorithm module is selected to solve the order-picking problem for fixed shelves of the automated warehouse.In this paper,based on Ant Colony Algorithm some new optimization methods are proposed,including real-time self-adapting adjustment of the parameter q0 according to iterations and updating of pheromones by using the elitist strategy and the two optimization methods are supported by the results of the simulation.Through the analysis,a new mathematical model of Ant Colony Algorithm is put forward.The results of the simulation show that the new algorithm can shorten the time of sorting out and improve the utilization efficiency of the automated warehouse in practical applications.

关 键 词：蚁群算法 路径优化 固定货架 TSP问题 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]