首页 | 官方网站   微博 | 高级检索  
     

基于改进粒子群算法的立体仓库货位分配优化
引用本文:陈月婷,何芳.基于改进粒子群算法的立体仓库货位分配优化[J].计算机工程与应用,2008,44(11):229-231.
作者姓名:陈月婷  何芳
作者单位:济南大学,控制科学与工程学院,济南,250022
基金项目:山东省自然科学基金(the Natural Science Foundation of Shangdong Province of China under Grant No.Y2006G25)
摘    要:研究自动化立体仓库固定货架的货位分配问题,货位分配综合考虑了货架的稳定性和出入库效率,建立了货位优化的数学模型,提出了基于Pareto最优解的改进粒子群算法(PSO)来解决此问题的方法。在优化过程中引用了置换的概念来计算粒子的速度,并且在算法中采用小生境技术提高非劣解集的分散性,用存档群体保存了非劣解。仿真实验证明,此优化策略可以有效地解决自动化立体仓库的货位分配问题。

关 键 词:自动化立体仓库  货位分配  粒子群算法(PSO)  置换
文章编号:1002-8331(2008)11-0229-03
收稿时间:2007-7-24
修稿时间:2007年7月24日

Location assignment optimization of AS/RS based on improved Particle Swarm Optimization
CHEN Yue-ting,HE Fang.Location assignment optimization of AS/RS based on improved Particle Swarm Optimization[J].Computer Engineering and Applications,2008,44(11):229-231.
Authors:CHEN Yue-ting  HE Fang
Affiliation:School of Control Science and Engineering,University of Ji’nan,Ji’nan 250022,China
Abstract:The goods location assignment of an automated warehouse is discussed in the paper.The stability of the shelf and the efficiency of the storage/retrieval operation are taken into account.The mathematic model is built to describe the problem of the location assignment optimization.Improved Particle Swarm Optimization(PSO)based on Pareto optimal solution is used to deal with the location assignment.In the process of optimization,the conception of permutation is adopted to calculate the velocity of the particles.Niche technique has been used to improve the diversity of non-inferior solutions.Archive is used to keep down all the non-inferior ones to the results.The simulation results indicate that it could be used to resolve the problem of the location assignment.
Keywords:automated warehouse  location assignment  Particle Swarm Optimization(PSO)  permutation
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号