Português
Ciência-IUL
Publications
Publication Detailed Description
Upper and lower bounds for the single source capacitated location problem
Journal Title
European Journal of Operational Research
Year (definitive publication)
2003
Language
English
Country
Netherlands
More Information
Web of Science®
Scopus
Google Scholar
This publication is not indexed in Google Scholar
Abstract
The single source capacitated location problem is considered. Given a set of potential locations and the plant capacities, it must be decided where and how many plants must be open and which clients must be assigned to each open plant. A Lagrangean relaxation is used to obtain lower bounds for this problem. Upper bounds are given by Lagrangean heuristics followed by search methods and by one tabu search metaheuristic. Computational experiments on different sets of problems are presented.
Acknowledgements
--
Keywords
Capacitated facility location,Lagrangean heuristics,Tabu search
Fields of Science and Technology Classification
- Economics and Business - Social Sciences
