Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems

Compact, multi-deep three-dimensional (3D), Automated Storage and Retrieval Systems (AS/RS) are becoming more common, due to new technologies, lower investment costs, time efficiency and compact size. Decision-making research on these systems is still in its infancy. This paper studies a particular compact system with rotating conveyors for the depth movement and a Storage/Retrieval (S/R) machine for the horizontal and vertical movement of unit loads. The optimal storage zone boundaries are determined for this system with two product classes: high- and low-turnover, by minimizing the expected S/R machine travel time. We formulate a mixed-integer non-linear programming model to determine the zone boundaries. A decomposition algorithm and a one-dimensional search scheme are developed to solve the model. The algorithm is complex, but the results are appealing since most of them are in closed-form and easy to apply to optimally layout the 3D AS/RS rack. The results show that the S/R machine travel time is significantly influenced by the zone dimensions, zone sizes and ABC curve skewness (presenting turnover patterns of different products). The presented results are compared with those under random storage and it is shown that significant reductions of the machine travel time are obtainable by using class-based storage. [Supplementary materials are available for this article. Go to the publisher's online edition of IIE Transactions for the following free supplemental resource: Appendix]

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

[2]  Wen-Jing Hsu,et al.  Travel time analysis of a new automated storage and retrieval system , 2005, Comput. Oper. Res..

[3]  BYUNG CHUN PARK,et al.  Dual command travel times and miniload system throughput with turnover-based storage , 2003 .

[4]  Dennis B. Webster,et al.  Modelling of three-dimensional warehouse systems , 1989 .

[5]  F. Robert Jacobs,et al.  Batch Construction Heuristics and Storage Assignment Strategies for Walk/Rideand Pick Systems , 1999 .

[6]  Byung Chun Park Performance of automated storage/retrieval systems with non-square-in-time racks and two-class storage , 2006 .

[7]  Jeroen P. van den Berg,et al.  Simulation study of an automated storage/retrieval system , 2000 .

[8]  Byung Soo Kim,et al.  Travel time model for the warehousing system with a tower crane S/R machine , 2002 .

[9]  M.-K. Lee *,et al.  Optimization of warehouse storage capacity under a dedicated storage policy , 2005 .

[10]  Meir J. Rosenblatt,et al.  Note-Deriving the Optimal Boundaries for Class-Based Automatic Storage/Retrieval Systems , 1989 .

[11]  R. (M.) B. M. de Koster,et al.  Optimal storage rack design for a 3-dimensional compact AS/RS , 2005 .

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

[13]  M. Brandeau,et al.  Note. Optimal Storage Assignment Policies for Automated Storage and Retrieval Systems with Stochastic Demands , 1998 .

[14]  Dennis B. Webster,et al.  Design of class-based storage racks for minimizing travel time in a three-dimensional storage system , 1989 .

[15]  Yugang Yu,et al.  Designing an optimal turnover-based storage rack for a 3D compact automated storage and retrieval system , 2009 .

[16]  Kevin R. Gue,et al.  Puzzle‐based storage systems , 2007 .

[17]  R.M.J. Heuts,et al.  A geometrical approach to computing expected cycle times for zonebased storage layouts in AS/RS , 2002 .

[18]  Meir J. Rosenblatt,et al.  ESTABLISHING ZONES IN SINGLE-COMMAND CLASS-BASED RECTANGULAR AS/RS , 1994 .

[19]  Noureddine Ghouali,et al.  Travel-time models for flow-rack automated storage and retrieval systems , 2005 .

[20]  Kevin R. Gue,et al.  Very high density storage systems , 2006 .

[21]  Panagiotis Kouvelis,et al.  Expected travel time and optimal boundary formulas for a two-class-based automated storage/retrieval system , 1995 .