首页 | 本学科首页   官方微博 | 高级检索  
     

基于改进蚁群算法拣选作业优化问题的求解
引用本文:李梅娟,陈雪波,刘臣奇.基于改进蚁群算法拣选作业优化问题的求解[J].计算机工程,2009,35(3):219-221.
作者姓名:李梅娟  陈雪波  刘臣奇
作者单位:1. 鞍山师范学院计算机系,鞍山,114005;大连理工大学信息与控制研究中心,大连,116024
2. 辽宁科技大学电子与信息工程学院,鞍山,114004
3. 鞍山师范学院计算机系,鞍山,114005
基金项目:国家自然科学基金,辽宁省高等学校优秀人才支持计划,辽宁省高等学校创新团队支持计划基金 
摘    要:合理优化拣选作业是提高自动化仓库整体运行效率的重要策略。针对自动化仓库固定货架拣选作业的特点,构建了货物拣选路径优化问题的数学模型,采取候选节点集合策略、选择算子及自适应调整算法参数改进措施,设计一种改进的蚁群算法。实验表明,该算法具有较好的全局寻优能力,收敛速度大幅度提高,能够较好地满足中大规模拣选作业要求。

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

Solution of Order Picking Optimization Problem Based on Improved Ant Colony Algorithm
LI Mei-juan,CHEN Xue-bo,LIU Chen-qi.Solution of Order Picking Optimization Problem Based on Improved Ant Colony Algorithm[J].Computer Engineering,2009,35(3):219-221.
Authors:LI Mei-juan  CHEN Xue-bo  LIU Chen-qi
Affiliation: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
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,...
Keywords:improved ant colony algorithm  automated warehouse  order picking  combinatorial optimization problem  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号