Optimal two-class-based storage policy in an AS/RS with two depots at opposite ends of the aisle

Abstract

Although automated storage/retrieval systems (AS/RSs) with two depots at opposite ends of each aisle (TD-AS/RSs) have been adopted in I-shaped warehouses (one of the three typical warehouse layouts), class-based storage policy has surprisingly not been investigated in TD-AS/RSs. This paper studies TD-AS/RSs with two storage zones, aiming to determine the optimal first storage zone that minimises the S/R machine’s expected travel time. We first formulate an expected travel time model. The analysis is then performed for two situations: (1) the ratio between the number of storage and total requests (Ratio-ST) is constant and (2) the Ratio-ST changes with time but follows a probability distribution. For the first situation, utilising proposed properties, an efficient optimal search-based algorithm (i.e. Algorithm 1) is developed. The results show that the proposed storage policy can improve system performance by up to about 60% and 40%, respectively, compared with two policies used in practice. Contrary to the literature results, our results indicate that the single command cycle performs better than the dual command cycle in the TD-AS/RS. For the second situation, an algorithm based on Algorithm 1 is developed. A case study using two real-world datasets confirms that our policy outperforms practically used policies in this situation.