Storage Optimization of Automated Storage and Retrieval Systems Using Breadth-First Search Algorithm

摘要

As discussed, BFS searches the nearest neighbors and the returns the nearest empty rack from the I/O point available, thus making the storage faster and optimized. The BFS being a blind searching technique takes longer time to search, but for application in ASRS which is associated with faster processors can reduce the execution time. There are other heuristic searching algorithms which can also be implemented in storage optimization of ASRS. The concept of virtual sensors is very effective and can be implemented according to the need. It is very flexible and can be associated with any searching algorithm for searching the empty racks for ASRS. It can make the system cheaper and simple.