基于蚁群算法的高层固定货架最短路径问题研究  

Research on the shortest path problem of the high-layer fix shelf based on ant colony system

作　　者：别文群[1] 苏虹[2] 

机构地区：[1]广东轻工职业技术学院现代教育中心,广东广州510300 [2]郑州轻工业学院计算机与通信工程学院,河南郑州450002

出　　处：《郑州轻工业学院学报（自然科学版）》2009年第6期9-14,共6页Journal of Zhengzhou University of Light Industry:Natural Science

基　　金：广东省东莞市2007年科技型中小企业技术创新基金项目(东科[2007]104)

摘　　要：应用蚁群算法的原理,通过建立数学模型,解决了立体仓库堆垛机自动行走最短路径和最短时间问题.利用蚁群算法的相互协同机制来解决高层固定货架最短路径问题的最优化,通过仿真实验,蚁群算法求堆垛机最短运行时间的效率提高了36.32%,最短路径长度的效率提高了56.7%,能够提高自动化立体仓库的作业效率.Applying the principle of the ant colony algorithm and building mathematics model ,the question of the automated storage＇s stacker crane to run about automatically shortest path and time was solved. It realizes the optimization of shortest path problems about the high-layer fix shelf by means of cooperation mechanism between ant colony. Finally, through the simulated experiment, the efficiency of the stacker crane running the shortest time rises by 36.32% ;and that of running the shortest path rises by 56.7% using the ant colony algorithm. In short, the ant colony algorithm can rise assignment efficiency of automated storage.

关 键 词：自动化立体仓库 蚁群算法 路径优化 最短时间 

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