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. / Singapore-MIT Alliance (SMA)
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/3856 |
| Date | 01 1900 |
| Creators | Hu, Yahong, Hsu, Wen Jing, Xu, Xiang |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Type | Article |
| Format | 643176 bytes, application/pdf |
| Relation | Computer Science (CS); |
Page generated in 0.0017 seconds