...
首页> 外文期刊>Mathematical Problems in Engineering >Order Picking Optimization in Carousels Storage System
【24h】

Order Picking Optimization in Carousels Storage System

机译:轮播存储系统中的订单拣选优化

获取原文
获取原文并翻译 | 示例
           

摘要

This paper addresses the order picking problem in a material handling system consisting of multiple carousels and one picker. Carousels are rotatable closed-loop storage systems for small items, where items are stored in bins along the loop. An order at carousels consists of n different items stored there. The objective is to find an optimal picking sequence to minimizing the total order picking time. After proving the problem to be strongly NP-hard and deriving two characteristics, we develop a dynamic programming algorithm (DPA) for a special case (two-carousel storage system) and an improved nearest items heuristics (INIH) for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show their better performance.
机译:本文解决了由多个传送带和一个拣选器组成的物料处理系统中的拣选问题。圆盘传送带是用于小物品的可旋转闭环存储系统,其中物品沿着环路存储在垃圾箱中。轮播中的订单由n个存储在其中的不同项目组成。目的是找到最佳的拣货顺序,以最大程度地减少总订单拣货时间。在证明该问题具有较强的NP难性并得出两个特征后,我们针对特殊情况(两轮转盘式存储系统)开发了动态规划算法(DPA),针对一般问题开发了改进的最近项启发式算法(INIH)。实验结果证明,该解决方案能够快速,稳定地实现,并显示出更好的性能。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2013年第12期|692701.1-692701.8|共8页
  • 作者单位

    South China Agr Univ, Coll Econ & Management, Guangzhou 510642, Guangdong, Peoples R China.;

    Jinan Univ, Dept Business Adm, Guangzhou 510632, Guangdong, Peoples R China.;

    South Chinese Normal Univ, Dept Informat & Engn, Nanhai 528225, Guangdong, Peoples R China.;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号