Skip to main content

A retrieval sequencing heuristic for miniload end-of-aisle automated storage/retrieval systems

Buy Article:

$60.90 plus tax (Refund Policy)


In this paper, a retrieval sequencing scheme aimed at improving the throughput of miniload automated storage/retrieval systems in an order picking environment is developed. We assume that an order comprised of retrieval requests is always available such that dual command cycles are always performed. A nearest-neighbour retrieval sequencing heuristic is presented, an analytical model is developed to predict its performance, and this model is validated using simulation. The heuristic is shown to improve throughput by 5-15% over traditional first-comefirst-served retrieval sequencing. The heuristic achieves this improvement by appropriately sequencing retrieval requests within an order and also optimizing retrieval requests among successive orders. An upper bound for throughput under any sequencing rule is established, and under the conditions tested, the heuristic is found to perform within 3-6% of this bound over different order sizes.

Document Type: Research Article


Publication date: June 1, 1998

More about this publication?

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Partial Open Access Content
Partial Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more