Please use this identifier to cite or link to this item:
|Title:||Warehouse-retailer network design problem||Authors:||Teo, C.-P.
|Keywords:||Facilities/equipment planning: location
Models, programming: integer
|Issue Date:||2004||Citation:||Teo, C.-P., Shu, J. (2004). Warehouse-retailer network design problem. Operations Research 52 (3) : 396-408+497. ScholarBank@NUS Repository. https://doi.org/10.1287/opre.1030.0096||Abstract:||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 logn) 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.||Source Title:||Operations Research||URI:||http://scholarbank.nus.edu.sg/handle/10635/44235||ISSN:||0030364X||DOI:||10.1287/opre.1030.0096|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.