Integrated design of supply chain networks with three echelons, multiple commodities and technology selection
Open Access
- 1 January 2008
- journal article
- research article
- Published by Taylor & Francis Ltd in IIE Transactions
- Vol. 40 (1), 31-44
- https://doi.org/10.1080/07408170701246641
Abstract
We consider a strategic supply chain design problem with three echelons, multiple commodities and technology selection. We model the problem as a tri-echelon, capacitated facility location problem that decides on the location of plants and warehouses, their capacity and technology planning, the assignment of commodities to plants and the flow of commodities to warehouses and customer zones. We use a mixed-integer programming formulation strengthened by valid but redundant constraints and apply Lagrangean relaxation to decompose the problem by echelon. Lagrangean relaxation provides a lower bound that is calculated using an interior-point cutting plane method. Feasible solutions are generated using a primal heuristic that uses the solution of the subproblems. Unlike common practice in the literature, the decomposition does not aim at getting easy subproblems, but rather at getting subproblems that preserve most of the characteristics of the original problem. Not only does this provide a sharp lower bound but also leads to a simple and efficient primal heuristic. We can afford to have relatively difficult subproblems because the interior-point cutting plane method used to solve the Lagrangean dual makes clever and selective choices of the Lagrangean multipliers leading to fewer calls to the subproblems. Computational results indicate the efficiency of the approach in providing a sharp bound and in generating feasible solutions that are of high quality.Keywords
This publication has 17 references indexed in Scilit:
- A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problemEuropean Journal of Operational Research, 2000
- Integrated production/distribution planning in supply chains: An invited reviewEuropean Journal of Operational Research, 1999
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility typeEuropean Journal of Operational Research, 1999
- Supply chain design and analysis:: Models and methodsInternational Journal of Production Economics, 1998
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithmMathematical Programming, 1993
- Decomposition and Nondifferentiable Optimization with the Projective AlgorithmManagement Science, 1992
- Facility location models for distribution planningEuropean Journal of Operational Research, 1985
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974