Efficient algorithms for load shuffling in split-platform AS/RS

We address the issue of shuffling loads in automated storage/retrieval system (AS/RS). To minimize the response time of retrievals, we pre-sort the loads into any specified locations. 1D, 2D and 3D AS/RS racks have been designed to achieve the shuffling efficiently. The corresponding shuffling algorithms are described in detail. The response time of retrieval, the lower and upper bounds of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient indeed.