The one-warehouse multi-retailer problem: reformulation, classification, and computational results

We consider the one-warehouse multi-retailer problem where a warehouse replenishes multiple retailers with deterministic dynamic demands over a horizon. The problem is to determine when and how much to order to the warehouse and retailers such that the total system-wide costs are minimized. We propose a new (combined transportation and shortest path based) integer programming reformulation for the problem in addition to the echelon stock and transportation based formulations in the literature. We analyze the strength of the LP relaxations of three formulations and show that the new formulation is stronger than others. We also show that the new and transportation based formulations are equivalent for the joint replenishment problem, where the warehouse is a crossdocking facility. We extend all formulations to the case with initial inventory at the warehouse and reveal the relation among their LP relaxations. We present our computational experiments with all formulations over a set of randomly generated test instances.

[1]  David B. Shmoys,et al.  A constant approximation algorithm for the one-warehouse multi-retailer problem , 2005, SODA '05.

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[3]  Lap Mui Ann Chan,et al.  Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures , 2002, Manag. Sci..

[4]  Hartmut Stadtler,et al.  Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times , 2008, OR Spectr..

[5]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

[6]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[7]  Awi Federgruen,et al.  Time‐partitioning heuristics: Application to one warehouse, multiitem, multiretailer lot‐sizing problems , 1999 .

[8]  Laurence A. Wolsey,et al.  Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[9]  Hartmut Stadtler,et al.  Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing , 1996 .

[10]  Arthur F. Veinott,et al.  Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems , 1969, Oper. Res..

[11]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[12]  Hartmut Stadtler,et al.  Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing , 1997 .

[13]  Yue Jin,et al.  Single‐warehouse multi‐retailer inventory systems with full truckload shipments , 2009 .

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[15]  Albert P. M. Wagelmans,et al.  Integrated Lot Sizing in Serial Supply Chains with Production Capacities , 2005, Manag. Sci..

[16]  Arunachalam Narayanan,et al.  Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms , 2009 .

[17]  Alain Martel,et al.  Dynamic Lot Sizing for Multi-Echelon Distribution Systems with Purchasing and Transportation Price Discounts , 1993, Oper. Res..

[18]  Basil A. Kalymon.  A Decomposition Algorithm for Arborescence Inventory Systems , 1972, Oper. Res..

[19]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[20]  Li-Lian Gao,et al.  A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging , 1996 .

[21]  Ömer Kirca,et al.  A primal‐dual algorithm for the dynamic lotsizing problem with joint set‐up costs , 1995 .

[22]  Powell E. Robinson,et al.  A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand , 2008, Math. Comput. Model..

[23]  E. Arkin,et al.  Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .