Logistics network design with inventory stocking for low-demand parts: Modeling and optimization

Abstract

This paper models, analyzes and develops solution techniques for a network design and inventory stocking problem. The proposed model captures important features of a real service part logistics system, namely time-based service level requirements, and stochastic demands satisfied by facilities operating with a one-for-one replenishment policy. In essence, along with usual decisions of location and allocation, the model considers stock levels and fill rates as decisions, varying across facilities to achieve system-wide target service levels. A variable substitution scheme is used to develop an equivalent convex model for an originally non-convex problem. An outer-approximation scheme is used to linearize the convex model. Exact solution schemes based on the linearized model are proposed and computationally less demanding lower and upper bounding techniques for the problem are devised. Results from extensive computational experiments on a variety of problem instances based on real-life industrial data show the effectiveness of the overall approach.

[Supplementary materials are available for this article. Go to the publisher's online edition of IIE Transactions for the following free supplemental resources: An Appendix consisting of proofs of the propositions, explanation and effectiveness of valid inequalities obtained via binary representation, settings of CPLEX options and further insights and observations.]

Keywords:

• Location-allocation
• inventory
• network design
• outer approximation

Acknowledgments

This research is supported in part by NSF CAREER Grant 0245123. Our industry partner provided real SPL-data for testing and validation. The paper was improved considerably, thanks to two anonymous referees' and associate editor's comments.

Notes

*Infeasible solutions.

*Infeasible solutions.

*Infeasible solutions.

*Infeasible solutions.

*Infeasible solutions.