The One-Warehouse Multiretailer Problem with an Order-Up-To Level Inventory Policy

Solyali O., SÜRAL H., Denizel M.

NAVAL RESEARCH LOGISTICS, vol.57, no.7, pp.653-666, 2010 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 57 Issue: 7
  • Publication Date: 2010
  • Doi Number: 10.1002/nav.20428
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.653-666
  • Keywords: one-warehouse multiretailer problem, order-up-to level inventory policy, lot-sizing, integer programming, strong formulation, ALGORITHM, VENDOR, SYSTEM, COST
  • Middle East Technical University Affiliated: Yes


We consider a two-level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order-up-to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot-sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state-of-the art solver reveal that our formulations are very effective in solving large-size instances to optimality. (C) 2010 Wiley Periodicals, Inc. Naval Research Logistics 57: 653-666, 2010