Journal of Global Optimization
Trade-offs Between Customer Service and Cost in Integrated Supply Chain Design
Manufacturing & Service Operations Management
Inbound Logistic Planning: Minimizing Transportation and Inventory Cost
Transportation Science
Integrated Stochastic Supply-Chain Design Models
Computing in Science and Engineering
Market selection decisions for inventory models with price-sensitive demand
Journal of Global Optimization
Risk management in uncapacitated facility location models with random demands
Computers and Operations Research
A scenario analysis of a location problem with uncertain demand
International Journal of Computer Applications in Technology
e-Work based collaborative optimization approach for strategic logistic network design problem
Computers and Industrial Engineering
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Facility Location Modeling and Inventory Management with Multisourcing
Transportation Science
A simulation-optimization approach for integrated sourcing and inventory decisions
Computers and Operations Research
Greedy approaches for a class of nonlinear Generalized Assignment Problems
Discrete Applied Mathematics
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
Expert Systems with Applications: An International Journal
Integrated location-inventory retail supply chain design: a multi-objective evolutionary approach
SEAL'10 Proceedings of the 8th international conference on Simulated evolution and learning
Strategic design of competing supply chain networks with foresight
Advances in Engineering Software
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics
Transportation Science
Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand
Transportation Science
On a nonseparable convex maximization problem with continuous knapsack constraints
Operations Research Letters
A profit-maximizing supply chain network design model with demand choice flexibility
Operations Research Letters
Polymatroids and mean-risk minimization in discrete optimization
Operations Research Letters
Expert Systems with Applications: An International Journal
Journal of Global Optimization
Process Location and Product Distribution with Uncertain Yields
Operations Research
Supply chain system design integrated with risk pooling
Computers and Industrial Engineering
Optimization of a stochastic remanufacturing network with an exchange option
Decision Support Systems
A hub location inventory model for bicycle sharing system design: Formulation and solution
Computers and Industrial Engineering
International Journal of Computer Applications in Technology
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
Linear location-inventory models for service parts logistics network design
Computers and Industrial Engineering
| Hi-index | 0.00 |
We consider a joint location-inventory problem involving a single supplier and multiple retailers. Associated with each retailer is some variable demand. Due to this variability, some amount of 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 (and therefore inventory storage locations) 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. We formulate this problem as a nonlinear integer-programming model. We then restructure this model into a set-covering integer-programming model. The pricing problem that must be solved as part of the column generation algorithm for the set-covering model involves a nonlinear term in the retailerdistribution-center allocation terms. We show that this pricing problem can (theoretically) be solved efficiently, in general, and we show how to solve it practically in two important cases. We present computational results on several instances of sizes ranging from 33 to 150 retailers. In all cases, the lower bound from the linear-programming relaxation to the set-covering model gives the optimal solution.