A Lagrangean Heuristic for a Modular Capacitated Location Problem

Isabel Correia () and M. Captivo

Annals of Operations Research, 2003, vol. 122, issue 1, 161 pages

Abstract: This paper considers the Modular Capacitated Location Problem (MCLP) which consists of finding the location and capacity of the facilities, to serve a set of customers at a minimum total cost. Each customer has an associated demand and the capacity of each potential location must be chosen from a finite and discrete set of available capacities. Practical applications of this problem can be found in the location of warehouses, schools, health care services or other types of public services. For the MCLP different mixed integer linear programming models are proposed. The authors develop upper and lower bounds on the problem's optimal value and present computational results with randomly generated tests problems. Copyright Kluwer Academic Publishers 2003

Keywords: capacitated location; Lagrangean heuristic; mixed integer linear programming (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (21)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1026146507143 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:122:y:2003:i:1:p:141-161:10.1023/a:1026146507143

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1026146507143

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().