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

自动化立体仓库固定货架拣选路径问题研究
引用本文:杨玮,李程,傅卫平,李雪莲.自动化立体仓库固定货架拣选路径问题研究[J].上海理工大学学报,2015,37(1):84-88.
作者姓名:杨玮  李程  傅卫平  李雪莲
作者单位:陕西科技大学 机电工程学院, 西安 710021;陕西科技大学 机电工程学院, 西安 710021;西安理工大学 机械与精密仪器工程学院, 西安 710048;陕西科技大学 机电工程学院, 西安 710021
基金项目:国家自然科学基金资助项目(11072192);陕西科技大学科研启动基金资助项目(BJ12-21);国家级大学生创新创业训练计划资助项目(201210708037);陕西省农业科技创新与攻关项目(2014K01-29-01);陕西省科技厅基金资助项目(14JK1093)
摘    要:为提高自动化立体仓库拣选效率,以存取时间最短为目标,针对单巷道固定货架拣选作业过程,构建了解决拣选作业路径优化问题的数学模型,提出结合模拟退火算法的混合粒子群算法.该算法在求解过程中用粒子群算法初始化种群,提高了优化效率,缩短了搜索时间;在迭代过程中采用模拟退火算法,利用其概率突跳能力,以避免基本粒子群算法迭代过程中陷入局部最优和早熟收敛.通过实例验证,该算法比标准粒子群算法所用时间短、收敛速度快、迭代次数少.

关 键 词:混合粒子群算法  模拟退火算法  单巷道固定货架  拣选路径
收稿时间:2014/4/10 0:00:00

Chosen Path Optiomization for Fixed Shelves in AS/RS
YANG Wei,LI Cheng,FU Weiping and LI Xuelian.Chosen Path Optiomization for Fixed Shelves in AS/RS[J].Journal of University of Shanghai For Science and Technology,2015,37(1):84-88.
Authors:YANG Wei  LI Cheng  FU Weiping and LI Xuelian
Institution:College of Mechanical & Electrical Engineering, Shaanxi University of Science & Technology, Xi'an 710021, China;College of Mechanical & Electrical Engineering, Shaanxi University of Science & Technology, Xi'an 710021, China;School of Mechanical and Precision Instrument Engineering, Xi'an University of Technology, Xi'an 710048, China;College of Mechanical & Electrical Engineering, Shaanxi University of Science & Technology, Xi'an 710021, China
Abstract:To improve the order picking efficiency and shorten storage time in Automatic Storage & Retrieval System (AS/RS), a mathematical model was constructed to solve the problem of picking path optimization.According to the operation character of the order picking of fixed shelf storage area in a single roadway, an hybrid particle swarm algorithm combined with simulated annealing algorithm was presented.In the solution process, particle swarm optimization (PSO) was used to initialize the swarm, so as to improve the searching performance of the algorithm and optimize the results.The method can improve the optimization efficiency and shorten the searching time.In the iterative process, the simulated annealing algorithm was used to avoid premature convergence and to prevent from getting into local optimum as in the conventional PSO due to its probabilistic jumping ability.The examples show that compared with the standard PSO, the algorithm has the merits of shorter calculation time, faster convergence and fewer times of iterations.
Keywords:hybrid particle swarm algorithm  simulated annealing algorithm  a single roadway fixed shelves  chosen path
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《上海理工大学学报》浏览原始摘要信息
点击此处可从《上海理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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