Storage layout of AS/RS racks based on recurrent orders

In many person-on-board AS/R systems, some very typical, recurrent orders have to be retrieved. In this paper, we present a straightforward methodology to design the storage layout of a rack when such recurrent orders represent a high percentage of total turnover. The approach makes use of sorting, assignment, and travelling slaesman like algorithms. The resulting layouts are compared against more classical arrangements. Numerical simulations show that, in specific situations, more than 30% saving in traveltime of the retrieval crane can be expected.