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

Order Picking in a Double Carousel System

作　　者：李晓春[1] 王国庆[2] 钟雪灵[3] 王雄志[4] 

机构地区：[1]华南师范大学南海校区信息工程与技术系,广东佛山528225 [2]暨南大学管理学院,广州510632 [3]广东金融学院,广州510520 [4]华南农业大学经济管理学院,广州510642

出　　处：《系统管理学报》2012年第1期76-82,共7页Journal of Systems & Management

基　　金：教育部人文社会科学研究项目基金资助项目(09YJC630088);华南师范大学南海校区资助项目(NHZL09006)

摘　　要：讨论了由一个拣货员负责的双旋转货架系统,考虑拣货员每次拣取货物所需时间不同,目标是寻找一种最优拣货顺序使得总拣货时间最小。该问题被证明为强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.

关 键 词：旋转货架 拣货 启发式算法 

分 类 号：F252[经济管理—国民经济]