A decomposition heuristic for the maximal covering location problem


Autoria(s): Pereira, Marcos Antonio; Senne, Edson Luiz Frana; Lorena, Luiz Antonio Nogueira
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

27/05/2014

27/05/2014

01/12/2010

Resumo

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. © 2010 Edson Luiz França Senne et al.

Identificador

http://dx.doi.org/10.1155/2010/120756

Advances in Operations Research, v. 2010.

1687-9147

1687-9155

http://hdl.handle.net/11449/72063

10.1155/2010/120756

2-s2.0-79958153845

2-s2.0-79958153845.pdf

Idioma(s)

eng

Relação

Advances in Operations Research

Direitos

openAccess

Tipo

info:eu-repo/semantics/article