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


     


OPERATIONS RESEARCH
Vol. 52, No. 3, May-June 2004, pp. 396-408
DOI: 10.1287/opre.1030.0096
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 Teo, C.-P.
Right arrow Articles by Shu, J.
Right arrow Search for Related Content

Warehouse-Retailer Network Design Problem

Chung-Piaw Teo, Jia Shu

Department of Decision Sciences, National University of Singapore, and Singapore-MIT Alliance Program
Department of Decision Sciences, National University of Singapore, and Singapore-MIT Alliance Program

bizteocp{at}nus.edu.sg
tlisj{at}nus.edu.sg

In this paper, we study the distribution network design problem integrating transportation and infinite horizon multiechelon inventory cost function. We consider the trade-off between inventory cost, direct shipment cost, and facility location cost in such a system. The problem is to determine how many warehouses to set up, where to locate them, how to serve the retailers using these warehouses, and to determine the optimal inventory policies for the warehouses and retailers. The objective is to minimize the total multiechelon inventory, transportation, and facility location costs. To the best of our knowledge, none of the papers in the area of distribution network design has explicitly addressed the issues of the 2-echelon inventory cost function arising from coordination of replenishment activities between the warehouses and the retailers. We structure this problem as a set-partitioning integer-programming model and solve it using column generation. The pricing subproblem that arises from the column generation algorithm gives rise to a new class of the submodular function minimization problem. We show that this pricing subproblem can be solved in O(n log n) time, where n is the number of retailers. Computational results show that the moderate size distribution network design problem can be solved efficiently via this approach.

Subject classifications: transportation; models; programming; integer; facilities/equipment planning; location.
History: Received March 2002; revision received January 2003; accepted March 2003.




This article has been cited by other articles:


Home page
Operations ResearchHome page
J. Zhang
Cost Allocation for Joint Replenishment Models
Operations Research, January 1, 2009; 57(1): 146 - 156.
[Abstract] [PDF]


Home page
Operations ResearchHome page
H. Song, V. N. Hsu, and R. K. Cheung
Distribution Coordination Between Suppliers and Customers with a Consolidation Center
Operations Research, September 1, 2008; 56(5): 1264 - 1277.
[Abstract] [PDF]


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 HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2004 by INFORMS.