Trade-offs Between Customer Service and Cost in Integrated Supply Chain Design
Manufacturing & Service Operations Management
Integrated Stochastic Supply-Chain Design Models
Computing in Science and Engineering
Computers and Industrial Engineering
An Efficient Greedy Heuristic for Warehouse-Retailer Network Design Optimization
Transportation Science
The Effect of Supply Disruptions on Supply Chain Design Decisions
Transportation Science
Integration of strategic and tactical decisions for vendor selection under capacity constraints
Computers and Operations Research
A primal-dual approximation algorithm for the k-level stochastic facility location problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Real Option Pricing of Network Design Investments
Transportation Science
Expert Systems with Applications: An International Journal
Real Option Pricing of Network Design Investments
Transportation Science
Strategic design of competing supply chain networks with foresight
Advances in Engineering Software
A multi-objective optimization for green supply chain network design
Decision Support Systems
Improved approximation algorithms for the robust fault-tolerant facility location problem
Information Processing Letters
An approximation algorithm for the k-level stochastic facility location problem
Operations Research Letters
A profit-maximizing supply chain network design model with demand choice flexibility
Operations Research Letters
Journal of Global Optimization
Process Location and Product Distribution with Uncertain Yields
Operations Research
A hub location inventory model for bicycle sharing system design: Formulation and solution
Computers and Industrial Engineering
Approximation Algorithms for Integrated Distribution Network Design Problems
INFORMS Journal on Computing
Expert Systems with Applications: An International Journal
A computational study for common network design in multi-commodity supply chains
Computers and Operations Research
Linear location-inventory models for service parts logistics network design
Computers and Industrial Engineering
| Hi-index | 0.00 |
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.