Computers and Operations Research
Computers and Industrial Engineering
Cost Allocation for Joint Replenishment Models
Operations Research
Hybrid algorithm for discrete event simulation based supply chain optimization
Expert Systems with Applications: An International Journal
A simulation-optimization approach for integrated sourcing and inventory decisions
Computers and Operations Research
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
Transportation Science
Integration of strategic and tactical decisions for vendor selection under capacity constraints
Computers and Operations Research
Expert Systems with Applications: An International Journal
On a nonseparable convex maximization problem with continuous knapsack constraints
Operations Research Letters
Impact of Variety and Distribution System Characteristics on Inventory Levels at U.S. Retailers
Manufacturing & Service Operations Management
Approximation Algorithms for Integrated Distribution Network Design Problems
INFORMS Journal on Computing
A computational study for common network design in multi-commodity supply chains
Computers and Operations Research
Hi-index | 0.00 |
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 inO( n?log? n) time, wheren is the number of retailers. Computational results show that the moderate size distribution network design problem can be solved efficiently via this approach.