单巷道固定货架路径规划问题的研究

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (16): 205-207.

单巷道固定货架路径规划问题的研究

王罡¹,李梅娟^1,2,陈雪波³

1.鞍山师范学院计算机系，辽宁鞍山 114005
2.大连理工大学信息与控制研究中心，辽宁大连 116024
3.辽宁科技大学电子与信息工程学院，辽宁鞍山 114004

收稿日期:2007-11-28 修回日期:2008-02-25 出版日期:2008-06-01 发布日期:2008-06-01
通讯作者: 王罡

Research on path planning problem for single aisle fixed storage rack

WANG Gang¹,LI Mei-juan^1,2,CHEN Xue-bo³

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

Received:2007-11-28 Revised:2008-02-25 Online:2008-06-01 Published:2008-06-01
Contact: WANG Gang

摘要/Abstract

摘要： 固定货架系统是自动化立体仓库的重要组成部分，仓库运行效率主要取决于对货物进行拣选的控制策略。针对单巷道固定货架系统拣选作业过程，以存取时间最小为目标，构建了含多个约束条件的拣选作业路径规划问题的数学模型。在基本蚁群算法基础上，采取自适应调整算法参数、候选节点集合等改进措施，设计了一种改进的蚁群算法对问题进行求解。仿真实验表明该算法能够很好地解决中大规模的拣选作业问题，全局寻优能力强，收敛速度快。

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.

王罡¹,李梅娟^1,2,陈雪波³. 单巷道固定货架路径规划问题的研究[J]. 计算机工程与应用, 2008, 44(16): 205-207.

WANG Gang¹,LI Mei-juan^1,2,CHEN Xue-bo³. Research on path planning problem for single aisle fixed storage rack[J]. Computer Engineering and Applications, 2008, 44(16): 205-207.