A dynamic programming algorithm for the space allocation and aisle positioning problem

Abstract

The space allocation and aisle positioning problem (SAAPP) in a material handling system with gravity flow racks is the problem of minimizing the total number of replenishments over a period subject to practical constraints related to the need for aisles granting safe and easy access to storage locations. In this paper, we develop an exact dynamic programming algorithm for the SAAPP. The computational study shows that our exact algorithm can be used to find optimal solutions for numerous SAAPP instances of moderate size.

Keywords:

• storage location assignment
• product allocation
• warehousing
• dynamic programming

Acknowledgements

We are indebted to the two anonymous referees for their insightful comments that have helped strengthen the paper.