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

Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems,10.1080/07408170802375778,Iie Transactio

Optimal zone boundaries for two-class-based compact three-dimensional automated storage and retrieval systems   (Citations: 8)
BibTex | RIS | RefWorks Download
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]
Journal: Iie Transactions , vol. 41, no. 3, pp. 194-208, 2009
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: