A decomposition heuristic for the maximal covering location problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1155/2010/120756 http://hdl.handle.net/11449/72063 |
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. |
id |
UNSP_d093b1de944fa4bf0da0b12bbcae5b52 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/72063 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A decomposition heuristic for the maximal covering location problemThis 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.Department of Mathematics Engineering College (FEG) São Paulo State University (UNESP), 12516-410 Guaratinguetá SPAssociate Laboratory of Applied Mathematics and Computation (LAC) Brazilian Institute for Space Research (INPE), 12201-970 So José dos Campos, SPDepartment of Mathematics Engineering College (FEG) São Paulo State University (UNESP), 12516-410 Guaratinguetá SPUniversidade Estadual Paulista (Unesp)Instituto Nacional de Pesquisas Espaciais (INPE)Pereira, Marcos Antonio [UNESP]Senne, Edson Luiz França [UNESP]Lorena, Luiz Antonio Nogueira2014-05-27T11:25:21Z2014-05-27T11:25:21Z2010-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://dx.doi.org/10.1155/2010/120756Advances in Operations Research, v. 2010.1687-91471687-9155http://hdl.handle.net/11449/7206310.1155/2010/1207562-s2.0-799581538452-s2.0-79958153845.pdf938673077014717813380082375900560000-0002-6544-2964Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengAdvances in Operations Research0,2050,205info:eu-repo/semantics/openAccess2023-12-21T06:18:40Zoai:repositorio.unesp.br:11449/72063Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462023-12-21T06:18:40Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A decomposition heuristic for the maximal covering location problem |
title |
A decomposition heuristic for the maximal covering location problem |
spellingShingle |
A decomposition heuristic for the maximal covering location problem Pereira, Marcos Antonio [UNESP] |
title_short |
A decomposition heuristic for the maximal covering location problem |
title_full |
A decomposition heuristic for the maximal covering location problem |
title_fullStr |
A decomposition heuristic for the maximal covering location problem |
title_full_unstemmed |
A decomposition heuristic for the maximal covering location problem |
title_sort |
A decomposition heuristic for the maximal covering location problem |
author |
Pereira, Marcos Antonio [UNESP] |
author_facet |
Pereira, Marcos Antonio [UNESP] Senne, Edson Luiz França [UNESP] Lorena, Luiz Antonio Nogueira |
author_role |
author |
author2 |
Senne, Edson Luiz França [UNESP] Lorena, Luiz Antonio Nogueira |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) Instituto Nacional de Pesquisas Espaciais (INPE) |
dc.contributor.author.fl_str_mv |
Pereira, Marcos Antonio [UNESP] Senne, Edson Luiz França [UNESP] Lorena, Luiz Antonio Nogueira |
description |
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. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-12-01 2014-05-27T11:25:21Z 2014-05-27T11:25:21Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
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 9386730770147178 1338008237590056 0000-0002-6544-2964 |
url |
http://dx.doi.org/10.1155/2010/120756 http://hdl.handle.net/11449/72063 |
identifier_str_mv |
Advances in Operations Research, v. 2010. 1687-9147 1687-9155 10.1155/2010/120756 2-s2.0-79958153845 2-s2.0-79958153845.pdf 9386730770147178 1338008237590056 0000-0002-6544-2964 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
Advances in Operations Research 0,205 0,205 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1803047040560660480 |