A Decomposition Heuristic for the Maximal Covering Location Problem

Edson Luiz França Senne, Marcos Antonio Pereira and Luiz Antonio Nogueira Lorena

Advances in Operations Research, 2010, vol. 2010, 1-12

Abstract:

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, are identified and relaxed in the Lagrangean way, resulting in disconnected subgraphs representing smaller subproblems that are computationally easier to solve by exact methods. The proposed technique is compared to the classical approach, using real data and instances from the available literature.

Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/AOR/2010/120756.pdf (application/pdf)
http://downloads.hindawi.com/journals/AOR/2010/120756.xml (text/xml)

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:hin:jnlaor:120756

DOI: 10.1155/2010/120756

Access Statistics for this article

More articles in Advances in Operations Research from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().