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

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

0.00 Avg rating0 Votes
Article ID: iaor201525384
Volume: 65
Issue: 9
Start Page Number: 1315
End Page Number: 1324
Publication Date: Sep 2014
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: allocation: resources, programming: dynamic
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.

Reviews

Required fields are marked *. Your email address will not be published.