Robust Storage Assignment in Unit‐Load Warehouses

Robust Storage Assignment in Unit‐Load Warehouses

0.00 Avg rating0 Votes
Article ID: iaor20127209
Volume: 58
Issue: 11
Start Page Number: 2114
End Page Number: 2130
Publication Date: Nov 2012
Journal: Management Science
Authors: , ,
Keywords: heuristics, programming: linear
Abstract:

Assigning products to and retrieving them from proper storage locations are crucial decisions in minimizing the operating cost of a unit‐load warehouse. The problem becomes intractable when the warehouse faces variable supply and uncertain demand in a multiperiod setting. We assume a factor‐based demand model in which demand for each product in each period is affinely dependent on some uncertain factors. The distributions of these factors are only partially characterized. We introduce a robust optimization model that minimizes the worst‐case expected total travel in the warehouse with distributional ambiguity of demand. Under a linear decision rule, we obtain a storage and retrieval policy by solving a moderate‐size linear optimization problem. Surprisingly, despite imprecise specification of demand distributions, our computational studies suggest that the linear policy achieves close to the expected value given perfect information and significantly outperforms existing heuristics in the literature.

Reviews

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