Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses

Order picking is one of the most time-critical processes in warehouses. We focus on the combined effects of routing methods and storage location assignment on process performance. We present exact formulas for the average route length under any storage location assignment for four common routing methods. Properties of optimal solutions are derived that strongly reduce the solution space. Furthermore, we provide a dynamic programming approach that determines storage location assignments, using the route length formulas and optimality properties. Experiments underline the importance of the introduced procedures by revealing storage assignment patterns that have not been described in literature before.

[1]  Yon-Chun Chou,et al.  Recency-based storage assignment and warehouse configuration for recurrent demands , 2012, Comput. Ind. Eng..

[2]  Ury Passy,et al.  The forward-reserve problem , 1994 .

[3]  Rommert Dekker,et al.  Improving Order-Picking Response Time at Ankor's Warehouse , 2004, Interfaces.

[4]  Gino Marchet,et al.  Routing policies and COI-based storage policies in picker-to-part systems , 1998 .

[5]  Kees Jan Roodbergen,et al.  Design and control of warehouse order picking: A literature review , 2006, Eur. J. Oper. Res..

[6]  Gajendra K. Adil,et al.  Class-based storage with exact S-shaped traversal routeing in low-level picker-to-part systems , 2013 .

[7]  Iris F. A. Vis,et al.  A model for warehouse layout , 2006 .

[8]  Gajendra K. Adil,et al.  Optimal class boundaries, number of aisles, and pick list size for low-level order picking systems , 2013 .

[9]  H. Hwang *,et al.  An evaluation of routing policies for order-picking operations in low-level picker-to-part system , 2004 .

[10]  Ming-Hung Wu,et al.  A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system , 2015, Computers & industrial engineering.

[11]  Marc Goetschalckx,et al.  Research on warehouse operation: A comprehensive review , 2007, Eur. J. Oper. Res..

[12]  Ming-Hung Wu,et al.  Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system , 2012, Comput. Ind. Eng..

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

[14]  Russell D. Meller,et al.  Analytical models for warehouse configuration , 2014 .

[15]  Chien-Ming Chen,et al.  A Flexible Evaluative Framework for Order Picking Systems , 2010 .

[16]  Gyu-Sung Cho,et al.  A performance evaluation model for order picking warehouse design , 2006, Comput. Ind. Eng..

[17]  Roger W. Schmenner,et al.  An Evaluation of Routing and Volume‐based Storage Policies in an Order Picking Operation , 1999 .

[18]  Pratik J. Parikh,et al.  A travel-time model for a person-onboard order picking system , 2010, Eur. J. Oper. Res..

[19]  Timm Gudehus,et al.  Mittlere Wegzeiten beim eindimensionalen Kommissionieren , 1975, Z. Oper. Research.

[20]  Loon Ching Tang,et al.  Travel time analysis for general item location assignment in a rectangular warehouse , 1999, Eur. J. Oper. Res..

[21]  Nursel Öztürk,et al.  Storage location assignment and order picking optimization in the automotive industry , 2012 .

[22]  Randolph W. Hall,et al.  DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE , 1993 .

[23]  Ling-feng Hsieh,et al.  The optimum design of a warehouse system on order picking efficiency , 2006 .

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

[25]  Tho Le-Duc,et al.  Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse , 2005 .

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

[27]  Gajendra Kumar Adil,et al.  A branch and bound algorithm for class based storage location assignment , 2008, Eur. J. Oper. Res..

[28]  Raymond G. Vickson,et al.  Product location, allocation and server home base location for an order picking line with multiple servers , 2004, Comput. Oper. Res..

[29]  P. C. Schuur,et al.  Mathematical model for warehouse design and product allocation , 2005 .

[30]  Donald D. Eisenstein.  Analysis and Optimal Design of Discrete Order Picking Technologies Along a Line , 2008 .

[31]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[32]  Birger Raa,et al.  Using a TSP heuristic for routing order pickers in warehouses , 2010, Eur. J. Oper. Res..