Optimization Online


A Linear Storage-Retrieval Policy for Robust Warehouse Management

Marcus Ang (smamatm***at***nus.edu.sg)
Yun Fong Lim (yflim***at***smu.edu.sg)
Melvyn Sim (melvynsim***at***nus.edu.sg)

Abstract: Assigning products to and retrieving them from proper storage locations in a unit-load warehouse are crucial in minimizing its operating cost. The problem becomes intractable when the warehouse faces uncertain demand in a dynamic 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 operating cost of a warehouse under distributional ambiguity. Under a linear decision rule, we can 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 simple linear policy achieves close to the expected value given perfect demand information, and significantly outperforms existing heuristics in the literature.

Keywords: Dynamic programming, Transportation, Materials handling, Inventory-production : Uncertainty

Category 1: Robust Optimization


Download: [PDF]

Entry Submitted: 11/10/2008
Entry Accepted: 11/10/2008
Entry Last Modified: 11/10/2008

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society