Title: Retrieval sequencing for unit-load automated storage and retrieval systems with multiple openings
Abstract:Abstract Automated storage and retrieval systems (AS/RS) have made a dramatic impact on material handling and inventory control in warehouses and product systems. A unit-load AS/RS is generic and othe...Abstract Automated storage and retrieval systems (AS/RS) have made a dramatic impact on material handling and inventory control in warehouses and product systems. A unit-load AS/RS is generic and other AS/RS represent its variations. In this paper, we study a problem of sequencing retrieval requests in a unit-load AS/RS. In a unit-load AS/RS, there are usually multiple openings and a unit-load can be stored in any opening. Given a list of retrieval requests and the locations of openings, this problem seeks a sequence of dual cycles that minimizes total travel time taken by a storage/retrieval machine. Previous researchers believed that this problem is computationally intractable and provided greedy-style heuristic algorithms. In this paper, we present an algorithm that combines the Hungarian method and the ranking algorithm for the assignment problem with tour-checking and tour-breaking algorithms. We show that this algorithm finds either a verified optimal or near-optimal solution quickly for moderate size problems. Using this algorithm, we also evaluate the effectiveness of the existing simple heuristics. Computational results are reported. Additional informationNotes on contributorsHEUNGSOON FELIX LEE To whom correspondence should be addressedRead More
Publication Year: 1996
Publication Date: 1996-10-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 74
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot