Efficient algorithms for load shuffling in automated storage/retrieval systems

In this paper, the issue of shuffling loads in automated storage/retrieval systems (AS/RS) is addressed. The objective of the shuffling is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. In order to achieve the shuffling efficiently, a new des...

Full description

Saved in:
Bibliographic Details
Published inProceedings 2003 IEEE International Symposium on Computational Intelligence in Robotics and Automation. Computational Intelligence in Robotics and Automation for the New Millennium (Cat. No.03EX694) Vol. 3; pp. 1156 - 1161 vol.3
Main Authors Hu Yahong, Xu Xiang, Hsu Wen-Jing, Toh Ah Cheong, Loh Chee Kit, Song Tiancheng
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Algorithm design and analysis
Automatic speech recognition
Cranes
Delay
Energy consumption
Information systems
Sorting
Storage automation
Throughput
Upper bound
Online AccessGet full text

Cover

More Information
Summary:In this paper, the issue of shuffling loads in automated storage/retrieval systems (AS/RS) is addressed. The objective of the shuffling is to pre-sort the loads into any specified locations in order to minimize the response time of retrievals. In order to achieve the shuffling efficiently, a new design of AS/RS has been presented. In the new AS/RS, each column has an associated vertical platform and each row has its own horizontal platform. 1D and 2D shuffling algorithms are described in detail. The response time of retrieval, the lower bound and upper bound of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient.
ISBN:9780780378667
0780378660
DOI:10.1109/CIRA.2003.1222160