双旋转货架拣货路径优化策略

Order Picking in a Double Carousel System

讨论了由一个拣货员负责的双旋转货架系统,考虑拣货员每次拣取货物所需时间不同,目标是寻找一种最优拣货顺序使得总拣货时间最小。该问题被证明为强NP-难问题,提出了几种启发式算法寻找最优拣货顺序,并对相关模型及算法进行模拟测试以证明其有效性,为方法选择与应用提供了依据。

In this paper we study an order picking problem er. Considering the picking time cannot be ignored, the obj the total order picking time. The problem has been proved ristic algorithms to find the optimized picking schedule. Me in a double carousel system with a single pick ective is to find a picking schedule to minimiz strongly NP-hard and we develop several heu anwhile, simulated testing is taken to validate its performance and reliability of each algorithm, which provides a reference for the application and the choice of order picking methods.