This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Shen, Z.-J. M. Articles by Daskin, M. S. Search for Related Content

A Joint Location–Inventory Model

Department of Industrial & Systems Engineering, University of Florida, Gainesville, Florida 32611
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois
shen{at}ise.ufl.edu
coullard{at}northwestern.edu
m\|[minus ]\|daskin{at}northwestern.edu

We consider a joint location–inventory problem involving a single supplier and multiple retailers. Associated with each retailer is some variable demand. Due to this variability, some amount of safety stock must be maintained to achieve suitable service levels. However, risk–pooling benefits may be achieved by allowing some retailers to serve as distribution centers (and therefore inventory storage locations) for other retailers. The problem is to determine which retailers should serve as distribution centers and how to allocate the other retailers to the distribution centers. We formulate this problem as a nonlinear integer–programming model. We then restructure this model into a set–covering integer–programming model. The pricing problem that must be solved as part of the column generation algorithm for the set–covering model involves a nonlinear term in the retailerdistribution–center allocation terms. We show that this pricing problem can (theoretically) be solved efficiently, in general, and we show how to solve it practically in two important cases. We present computational results on several instances of sizes ranging from 33 to 150 retailers. In all cases, the lower bound from the linear–programming relaxation to the set–covering model gives the optimal solution.

History: Received: July 2000; revised: September 2001; accepted: July 2002.

This article has been cited by other articles:

				H. Naseraldin and Y. T. Herer Integrating the Number and Location of Retail Outlets on a Line with Replenishment Decisions Management Science, September 1, 2008; 54(9): 1666 - 1683. [Abstract] [PDF]

				S. Benjaafar, Y. Li, D. Xu, and S. Elhedhli Demand Allocation in Systems with Multiple Inventory Locations and Multiple Demand Sources MSOM, January 1, 2008; 10(1): 43 - 60. [Abstract] [PDF]

				N. Vidyarthi, E. Celebi, S. Elhedhli, and E. Jewkes Integrated Production-Inventory-Distribution System Design with Risk Pooling: Model Formulation and Heuristic Solution Transportation Science, August 1, 2007; 41(3): 392 - 408. [Abstract] [PDF]

				O. Berman and Q. Wang Inbound Logistic Planning: Minimizing Transportation and Inventory Cost Transportation Science, August 1, 2006; 40(3): 287 - 299. [Abstract] [PDF]

				Z.-J. M. Shen and M. S. Daskin Trade-offs Between Customer Service and Cost in Integrated Supply Chain Design MSOM, January 1, 2005; 7(3): 188 - 207. [Abstract] [PDF]

				J. Shu, C.-P. Teo, and Z.-J. M. Shen Stochastic Transportation-Inventory Network Design Problem Operations Research, January 1, 2005; 53(1): 48 - 60. [Abstract] [PDF]