【24h】

Optimal Order Picking in Carousels Storage System

机译:旋转木马存储系统中的最优秩序

获取原文

摘要

We study the order picking problem in carousels system with a single picker. The objective is to find a picking scheduling to minimizing the total order picking time. After showing the problem being strongly in NP-Hard and finding two characteristics, we construct an approximation algorithm for a special case (two carousels) and a heuristics for the general problem. Experimental results verify that the solutions are quickly and steadily achieved and show its better performance.
机译:我们用单个选择器研究旋转木马系统的拣选问题。目标是找到拣选调度以最小化总订单采摘时间。在显示出在NP - 硬并找到两个特征中的问题之后,我们构建一个特殊情况(两个旋转木马)的近似算法和一般问题的启发式。实验结果验证了解决方案是否迅速稳定地实现并显示出其更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号