Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 123, Issue 2, Pages 271-291Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(99)00256-8
Keywords
multiperiod multi-echelon facility-location; integer programming; Lagrangean dual; heuristic
Ask authors/readers for more resources
In this paper we deal with a facility location problem where one desires to establish facilities at two different distribution levels by selecting the time periods. Our model intends to minimize the total cost for meeting demands for all the products specified over the planning horizon at various customer locations while satisfying the capacity requirements of the production plants and intermediate warehouses. We address this problem by means of a formulation as a mixed integer programming problem. A Lagrangean relaxation is proposed to solve the problem, together with a heuristic procedure that constructs feasible solutions of the original problem from the solutions at the lower bounds obtained by the relaxed problems. Computational tests are provided showing the good performance of this approach for a wide range of problems. (C) 2000 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available