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

单巷道固定货架路径规划问题的研究
引用本文:王罡,李梅娟,陈雪波. 单巷道固定货架路径规划问题的研究[J]. 计算机工程与应用, 2008, 44(16): 205-207. DOI: 10.3778/j.issn.1002-8331.2008.16.063
作者姓名:王罡  李梅娟  陈雪波
作者单位:鞍山师范学院,计算机系,辽宁,鞍山,114005;鞍山师范学院,计算机系,辽宁,鞍山,114005;大连理工大学,信息与控制研究中心,辽宁,大连,116024;辽宁科技大学,电子与信息工程学院,辽宁,鞍山,114004
基金项目:国家自然科学基金 , 辽宁省高等学校优秀人才支持计划 , 创新团队支持计划项目
摘    要:固定货架系统是自动化立体仓库的重要组成部分,仓库运行效率主要取决于对货物进行拣选的控制策略。针对单巷道固定货架系统拣选作业过程,以存取时间最小为目标,构建了含多个约束条件的拣选作业路径规划问题的数学模型。在基本蚁群算法基础上,采取自适应调整算法参数、候选节点集合等改进措施,设计了一种改进的蚁群算法对问题进行求解。仿真实验表明该算法能够很好地解决中大规模的拣选作业问题,全局寻优能力强,收敛速度快。

关 键 词:单巷道固定货架  路径规划问题  改进蚁群算法
文章编号:1002-8331(2008)16-0205-03
收稿时间:2007-11-28
修稿时间:2007-11-28

Research on path planning problem for single aisle fixed storage rack
WANG Gang,LI Mei-juan,CHEN Xue-bo. Research on path planning problem for single aisle fixed storage rack[J]. Computer Engineering and Applications, 2008, 44(16): 205-207. DOI: 10.3778/j.issn.1002-8331.2008.16.063
Authors:WANG Gang  LI Mei-juan  CHEN Xue-bo
Affiliation:1.Department of Computer,Anshan Normal University,Anshan,Liaoning 114005,China 2.Research Center of Information and Control,Dalian University of Technology,Dalian,Liaoning 116024,China 3.School of Electronic and Information Engineering,Liaoning University of Science and Technology,Anshan,Liaoning 114004,China
Abstract:Fixed storage rack system is an important part of the automated warehouse.The efficiency of warehouse depends on the control strategies of order picking.According to the order picking procedure in the single aisle rack,a mathematic model is constructed with multiple constraints and the optimization aim is to minimum the storage and retrieval time.It adopts dynamic change on algorithm parameters and awaiting nodes set based on the basic ant colony algorithm,and designs an improved ant colony algorithm for the order picking path planning problem.Simulation results demonstrate the improved algorithm can solve medium or large scale problem,it also has better overall search ability and quickly astringency.
Keywords:single aisle storage rack  path planning problem  improved Ant Colony Algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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