Batch Construction Heuristics and Storage Assignment Strategies for Walk/Rideand Pick Systems

The retrieval of items from storage is a chore faced by virtually every business concern. Walk/ride and pick systems are a popular method for performing this chore in many applications. When retrieval requests consist of multiple items, order pickers must travel to numerous storage locations to complete each order. When these requests are made in sufficient volume, a method of order retrieval known as batch picking is often used. Batch picking is a popular approach in the mail-order industry and is employed in industrial settings such as tool cribs and in warehouses, which service assembly line operations. Batch construction heuristics are developed and tested under three strategies for assigning storage space to individual items that have been suggeste d in the literature. Our results are derived from the simulation of a single hypothetical warehouse model. Specifically, we employ a model that is square in travel distance and assume the walk and pick method of order retrieval with sequential one-way travel. Sensitivity analysis is performed on workforce level and batch size. Our results indicate that the methods used for constructing batches of orders and for assigning storage space to individual items can significantly impact order retrieval efforts in warehouses of this type.

[1]  Uday S. Karmarkar,et al.  Design and operation of an order-consolidation warehouse: Models and application , 1992 .

[2]  Marc Goetschalckx,et al.  Shared Storage Policies Based on the Duration Stay of Unit Loads , 1990 .

[3]  R. Ballou.  Business Logistics Management , 1991 .

[4]  Stephen C. Graves,et al.  Optimal Storage Assignment in Automatic Warehousing Systems , 1976 .

[5]  Stephen C. Graves,et al.  Storage-Retrieval Interleaving in Automatic Warehousing Systems , 1977 .

[6]  Gilles Cormier,et al.  A review of warehouse models , 1992 .

[7]  D. Van Oudheusden,et al.  Storage layout of AS/RS racks based on recurrent orders , 1992 .

[8]  E. A. Frazele,et al.  Correlated assignment strategy can improve any order-picking operation , 1989 .

[9]  Bruce G. Barrett.  A Further Digression on the Over-Automated Warehouse: Some Evidence , 1977 .

[10]  Elsayed A. Elsayed,et al.  Order batching algorithms and travel-time estimation for automated storage/retrieval systems , 1989 .

[11]  Edward Hardy Frazelle.  Stock location assignment and order picking productivity , 1989 .

[12]  Edward D. McDowell,et al.  Optimal Product Layout in an Order Picking Warehouse , 1991 .

[13]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[14]  Yavuz A. Bozer,et al.  Travel-Time Models for Automated Storage/Retrieval Systems , 1984 .

[15]  Thomas L. Landers,et al.  An Assignment Algorithm for Dynamic Picking Systems , 1996 .

[16]  Elsayed A. Elsayed,et al.  Order processing in automated storage/retrieval systems with due dates , 1996 .

[17]  Gunter P. Sharp,et al.  A structured procedure for analysis and design of order pick systems , 1996 .

[18]  Ronald D. Armstrong,et al.  Optimal Batching in a Semi-Automated Order Picking System , 1979 .

[19]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[20]  Gunter P. Sharp,et al.  Order batching procedures , 1992 .

[21]  David S. Johnson,et al.  Fast Algorithms for Bin Packing , 1974, J. Comput. Syst. Sci..

[22]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[23]  Stephen C. Graves,et al.  Scheduling Policies for Automatic Warehousing Systems: Simulation Results , 1978 .