Please use this identifier to cite or link to this item: https://doi.org/10.1287/opre.1030.0096
DC FieldValue
dc.titleWarehouse-retailer network design problem
dc.contributor.authorTeo, C.-P.
dc.contributor.authorShu, J.
dc.date.accessioned2013-10-09T06:19:23Z
dc.date.available2013-10-09T06:19:23Z
dc.date.issued2004
dc.identifier.citationTeo, 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
dc.identifier.issn0030364X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/44235
dc.description.abstractIn 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1287/opre.1030.0096
dc.sourceScopus
dc.subjectFacilities/equipment planning: location
dc.subjectModels, programming: integer
dc.subjectTransportation
dc.typeArticle
dc.contributor.departmentTHE LOGISTICS INSTITUTE - ASIA PACIFIC
dc.contributor.departmentDECISION SCIENCES
dc.description.doi10.1287/opre.1030.0096
dc.description.sourcetitleOperations Research
dc.description.volume52
dc.description.issue3
dc.description.page396-408+497
dc.description.codenOPREA
dc.identifier.isiut000221972800005
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

134
checked on Jan 31, 2023

WEB OF SCIENCETM
Citations

112
checked on Jan 24, 2023

Page view(s)

481
checked on Feb 2, 2023

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.