We address the issue of shuffling loads in Automated Storage/Retrieval Systems (AS/RS) in this paper. The objective is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. 1D, 2D and 3D AS/RS racks have been designed in order to achieve the shuffling efficiently. The 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.
展开▼
机译：我们在本文中解决了自动存储/检索系统（AS / RS）中的混洗负荷问题。目的是将负载预先分类到任何指定的位置，以最大程度地缩短检索的响应时间。设计了1D，2D和3D AS / RS机架，以有效地实现改组。详细描述了改组算法。还得出了检索的响应时间，能耗的上下限。分析和数值实验结果表明，改组算法非常有效。
展开▼
