Variable neighborhood search heuristic for storage location assignment and storage/retrieval scheduling under shared storage in multi-shuttle automated storage/retrieval systems

• Formulate the location assignment and scheduling problem in multi-shuttle AS/RS.
• Verify the advantage of operational mode under shared storage.
• Develop a competitive variable neighborhood search algorithm to solve the problem.
• Investigate the performance of the proposed algorithm and parametric sensitivity.

This paper examines the joint optimization of storage location assignment and storage/retrieval scheduling in multi-shuttle automated storage/retrieval systems (AS/RSs) under shared storage, in which the reuse of empty location yielded by retrieval operation is allowed. From the view of analytical model, the advantage of operational mode under shared storage is verified. A variable neighborhood search (VNS) algorithm is developed to solve the large-sized problems. Various numerical experiments are conducted to evaluate the performance of the proposed algorithm and investigate the impact of different parameters on computational efficiency.