Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 53, No. 1, January-February 2005, pp. 48-60
DOI: 10.1287/opre.1040.0140
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Shu, J.
Right arrow Articles by Shen, Z.-J. M.
Right arrow Search for Related Content

Stochastic Transportation-Inventory Network Design Problem

Jia Shu, Chung-Piaw Teo, Zuo-Jun Max Shen

High Performance Computation for Engineered Systems, Singapore-MIT Alliance, and Department of Decision Sciences, National University of Singapore, Singapore
High Performance Computation for Engineered Systems, Singapore-MIT Alliance, and Department of Decision Sciences, National University of Singapore, Singapore
Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720

tlisj{at}nus.edu.sg
bizteocp{at}nus.edu.sg
shen{at}ieor.berkeley.edu

We study the stochastic transportation-inventory network design problem involving one supplier and multiple retailers. Each retailer faces some uncertain demand, and 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 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. Shen et al. (2003) formulated this problem as a set-covering integer-programming model. The pricing problem that arises from the column generation algorithm gives rise to a new class of the submodular function minimization problem. In this paper, we show that by exploiting certain special structures, we can solve the general pricing problem in Shen et al. efficiently. Our approach utilizes the fact that the set of all lines in a two-dimension plane has low VC-dimension. We present computational results on several instances of sizes ranging from 40 to 500 retailers. Our solution technique can be applied to a wide range of other concave cost-minimization problems.

Subject classifications: facilities/equipment planning:stochastic; inventory/production:uncertainty; stochastic; programming:nonlinear.
History: Received October 2001; revision received December 2002; accepted September 2003.




This article has been cited by other articles:


Home page
Management ScienceHome page
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]


Home page
Transportation ScienceHome page
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]


Home page
MSOMHome page
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]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2005 by INFORMS.