计算机工程 ›› 2010, Vol. 36 ›› Issue (3): 221-223.doi: 10.3969/j.issn.1000-3428.2010.03.074

• 人工智能及识别技术 • 上一篇    下一篇

基于蚁群优化算法的旋转货架拣选路径规划

王 罡1,冯艳君2   

  1. (1. 鞍山师范学院计算机系,鞍山 114005;2. 鞍山师范学院高等职业技术学院,鞍山 114011)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-02-05 发布日期:2010-02-05

Picking Path Plan for Carousel Based on Ant Colony Optimization Algorithm

WANG Gang1, FENG Yan-jun2   

  1. (1. Department of Computer, Anshan Normal University, Anshan 114005; 2. Higher Professional Technology Institute, Anshan Normal School, Anshan 114011)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-02-05 Published:2010-02-05

摘要: 给出自动化立体仓库单拣选台分层水平旋转货架系统的数学模型,提出一种改进的蚁群优化算法,用于解决货物拣选路径规划问题。该算法能快速找到最优货物拣选路径,得到的解质量较高且计算时间短。仿真结果表明,该方法适用于求解中小规模货物拣选路径的规划问题,可以提高自动存储作业效率。

关键词: 蚁群优化算法, 自动化立体仓库, 旋转货架, 路径规划

Abstract: This paper gives a mathematical model for hierarchical leveled carousel system with single picking station of automatic stereoscopic warehouse and proposes an improved Ant Colony Optimization algorithm(ACO) to solve the problem of goods picking path plan. The algorithm can find the optimal goods picking path rapidly, get high quality solution and short computation time. Simulation results show that the algorithm is suitable for solving plan problem of medium and small scale goods picking path and can improve the operating efficiency of automatic storage.

Key words: Ant Colony Optimization(ACO) algorithm, automatic stereoscopic warehouse, carousel, path plan

中图分类号: