作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (3): 219-221. doi: 10.3969/j.issn.1000-3428.2009.03.074

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

基于改进蚁群算法拣选作业优化问题的求解

李梅娟1,2,陈雪波3,刘臣奇1   

  1. (1. 鞍山师范学院计算机系,鞍山 114005;2. 大连理工大学信息与控制研究中心,大连 116024;3. 辽宁科技大学电子与信息工程学院,鞍山 114004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-02-05 发布日期:2009-02-05

Solution of Order Picking Optimization Problem Based on Improved Ant Colony Algorithm

LI Mei-juan1,2, CHEN Xue-bo3, LIU Chen-qi1   

  1. (1. Department of Computer, Anshan Normal University, Anshan 114005; 2. Research Center of Information and Control, Dalian University of Technology, Dalian 116024; 3. School of Electronic and Information Engineering, Liaoning University of Science and Technology, Anshan 114004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-02-05 Published:2009-02-05

摘要: 合理优化拣选作业是提高自动化仓库整体运行效率的重要策略。针对自动化仓库固定货架拣选作业的特点,构建了货物拣选路径优化问题的数学模型,采取候选节点集合策略、选择算子及自适应调整算法参数改进措施,设计一种改进的蚁群算法。实验表明,该算法具有较好的全局寻优能力,收敛速度大幅度提高,能够较好地满足中大规模拣选作业要求。

关键词: 改进蚁群算法, 自动化仓库, 拣选作业, 组合优化问题

Abstract: Optimizing the order picking is an important strategy to improve the working efficiency of automated warehouse. According to the requirements of order picking tasks of the fixed shelve, a mathematic model is constructed. An improved ant colony algorithm for the order picking problem is designed. Three improvements are adopted: awaiting nodes set, selection operator and dynamic change on algorithm parameters. Simulation results demonstrate the approach has better overall search ability and quickly astringency, satisfying the demands of medium or large scale work.

Key words: improved ant colony algorithm, automated warehouse, order picking, combinatorial optimization problem

中图分类号: