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

基于混合粒子群算法的货位优化分配问题
引用本文:黄丹华,王肃.基于混合粒子群算法的货位优化分配问题[J].应用科技,2013(4):9-13.
作者姓名:黄丹华  王肃
作者单位:[1]华东政法大学图书馆,上海200042 [2]华东师范大学计算中心,上海200062
基金项目:上海市自然科学基金资助项目(10ZR1410400).
摘    要:基于COI分类存放的思想,同时考虑到货位分配问题中存取开销和占地花费的平衡,提出了一种混合粒子群算法以解决仓库货位优化分配问题.建立货位分配模型,并引入了货物的COI值对货物进行重新分类.将粒子群算法同人工蜂群算法相结合,通过优化COI值从而对货位进行优化分配.最后,进行实验分析并证明了混合粒子群算法的正确性,可有效地应用分类存放策对货位进行优化分配,减少货位数和存货代价.

关 键 词:货位分配  COI  分类存放  粒子群算法  人工蜂群算法

A hybrid particle swarm optimization algorithm for storage allocation optimization problem
HUANG Danhua,WANG Su.A hybrid particle swarm optimization algorithm for storage allocation optimization problem[J].Applied Science and Technology,2013(4):9-13.
Authors:HUANG Danhua  WANG Su
Institution:1. Library, East China University of Political Science and Law, Shanghai 200042, China 2. Computer Center, East China Normal University, Shanghai 200062,China)
Abstract:Considering both of order-picking cost and storage-space cost, a hybrid particle swarm optimization algorithm is presented to solve the storage allocation optimization problem based on the COI warehouse storage policy. The storage allocation model is described and the concept of COI is introduced to reclassify the products and dispatch each of them to the most appropriate storage. The hybrid PSO algorithm combined PSO and artificial bee colony algorithm to get the best COI value so that it can get the best storage allocation resolution. Simulations Verify the hybrid PSO algorithm. The hybrid PSO algorithm can effectively employ COI Warehouse Storage Policy to optimize storage allocation and reduce both amount of storage allocation and cost.
Keywords:storage allocation  COI  class-based storage  particle swarm optimization  artificial bee colony
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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