首页> 外文会议>IEEE Global Communications Conference >A Genetic-Algorithm Based Method for Storage Location Assignments in Mobile Rack Warehouses
【24h】

A Genetic-Algorithm Based Method for Storage Location Assignments in Mobile Rack Warehouses

机译:基于遗传算法的移动货架仓库存储位置分配方法

获取原文

摘要

In recent years, mobile racks or auto robots have been widely used in e-commerce warehouses where storage location assignment is a fundamental problem in the order picking process. The present storage location assignment strategies mainly allocate stocks into various racks according to a specific objective function or the relationships between stocks. These strategies include the random storage assignment strategy (RAS) and the good- clustering storage location assignment strategy (GCAS). In this paper, we first analyze the key factors that affect the efficiency of the order picking system.The results show that the rack- moved-number (RMN) is a significant factor in the order picking process. Then, we propose a genetic- algorithm (GA) based method for the storage location assignment problem which adopts RMN as its fitness function. To find a better solution, we take the natural deduplicated stock sequence of history orders (NDSSHO) as a seed to initialize the population of chromosomes. We also define a specific cross mutation strategy to avoid checking the validity of chromosomes by exchanging selected genes and adjusting new generated chromosomes. At last, we compare the RMN of our proposed method with RAS and GCAS. The experimental results show that the RMN of our proposed method is about 50% less than RAS and GCAS.
机译:近年来,移动式货架或自动机器人已广泛用于电子商务仓库,在这些仓库中,存储位置的分配是订单拣选过程中的基本问题。当前的存储位置分配策略主要根据特定的目标函数或库存之间的关系将库存分配到各种架子中。这些策略包括随机存储分配策略(RAS)和良好聚类的存储位置分配策略(GCAS)。在本文中,我们首先分析了影响订单拣选系统效率的关键因素。结果表明,货架号(RMN)是订单拣选过程中的重要因素。然后,针对RMN作为适应度函数,提出了一种基于遗传算法的存储位置分配问题。为了找到更好的解决方案,我们将历史订单的自然重复数据删除股票序列(NDSSHO)作为种子来初始化染色体种群。我们还定义了一种特定的交叉突变策略,可以通过交换选定的基因和调整新生成的染色体来避免检查染色体的有效性。最后,我们将我们提出的方法的RMN与RAS和GCAS进行了比较。实验结果表明,我们提出的方法的RMN约比RAS和GCAS少50%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号