| 基于蚁群优化算法的旋转货架拣选路径规划 |
| |
| 引用本文： | 王罡,冯艳君.基于蚁群优化算法的旋转货架拣选路径规划[J].计算机工程,2010,36(3):221-223. |
| |
| 作者姓名： | 王罡 冯艳君 |
| |
| 作者单位： | 1. 鞍山师范学院计算机系,鞍山,114005
2. 鞍山师范学院高等职业技术学院,鞍山,114011 |
| |
| 基金项目： | 辽宁省教育厅科学研究计划基金资助项目(2005009) |
| |
| 摘 要： | 给出自动化立体仓库单拣选台分层水平旋转货架系统的数学模型，提出一种改进的蚁群优化算法，用于解决货物拣选路径规划问题。该算法能快速找到最优货物拣选路径，得到的解质量较高且计算时间短。仿真结果表明，该方法适用于求解中小规模货物拣选路径的规划问题，可以提高自动存储作业效率。
|
| 关 键 词： | 蚁群优化算法 自动化立体仓库 旋转货架 路径规划 |
| 修稿时间： | |
Picking Path Plan for Carousel Based on Ant Colony Optimization Algorithm |
| |
| WANG Gang,FENG Yan-jun.Picking Path Plan for Carousel Based on Ant Colony Optimization Algorithm[J].Computer Engineering,2010,36(3):221-223. |
| |
| Authors: | WANG Gang FENG Yan-jun |
| |
| Affiliation: | (1. Department of Computer, Anshan Normal University, Anshan 114005; 2. Higher Professional Technology Institute, Anshan Normal School, Anshan 114011) |
| |
| 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. |
| |
| Keywords: | Ant Colony Optimization(ACO) algorithm automatic stereoscopic warehouse carousel path plan |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
