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

摘要

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-neigh- bour retrieval sequencing heuristic is presented, an analytical model is developed to predict its performance, and this model is validated using simulation. The heurisitc is shown to improve throughput by 5-15/100 over traditional first-come- first-served retrieval sequencing.