| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1134312 | Computers & Industrial Engineering | 2012 | 5 Pages |
The sequencing of requests in an automated storage and retrieval system was the subject of many studies in literature. However, these studies assumed that the locations of items to be stored and retrieved are known and the sequencing problem consisted in determining a route of minimal travel time between these locations. In reality, for a retrieval request, an item can be in multiple locations of the rack and so there is a set of locations associated with this item and not only one predetermined location in the rack. In this paper, we deal with the sequencing problem where a required product can be in several rack locations and there is a set of empty locations. Consequently, the retrieval and storage locations are not known a priori. We sequence by the minimum travel time of a double cycle (DC). An optimization method working step-by-step is developed to determine for each DC and according to storage and retrieval requests, the location of the item to be stored and the location of the item to be retrieved allowing the minimum DC time. The storage requests are processed in FCFS and retrieval requests retrievals requests are gathered by block according to wave sequencing.
► We suggest an improved optimization method for the sequencing of a unit-load AS/RS. ► An integer program is proposed to model the retrieval problem. ► The approach gives the best solutions for both storage and retrieval locations. ► We assume more realistic assumptions than the conventional method for a real case.
