Simulation study of an automated storage/retrieval system

In this paper we present a simulation study of an automated storage/retrieval system and examine a wide variety of control policies. We compare several storage location assignment policies. For the class-based storage policy, we apply a recent algorithm that enables us to evaluate the trade-off between storage space requirements and travel times. We also study a new storage location policy which combines low storage space requirements with short mean travel times. Furthermore, we study the sequencing of storage and retrieval requests whereby we focus on the trade-off between efficient travel of the S/R machines and response time performance.