Advertisement
Published in:
2015 | OriginalPaper | Chapter
The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension
Authors : Henan Liu, Yinfeng Xu
Published in: Frontiers in Algorithmics
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In this paper, we study the online storage strategy problem for one-dimensional automated storage and retrieval system with \( m \) storage units. The items released online overlist need to be assigned to the storage units via a picker. The departure time of the item is known at the moment that it is released. Our goal is to minimize the total travel distance of the picker. We show that without transposition process, there is no online strategy with a competitive ratio less than \( m \). We also present an online strategy that includes transposition process has competitive ratio \( (\frac{\sqrt{5}-1}{2}) m\). The ratio between the number of sorted units and \( m \) is around \( \frac{3-\sqrt{5}}{2}\).