A column generation approach for the maximal covering location problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2007 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1111/j.1475-3995.2007.00593.x http://hdl.handle.net/11449/225595 |
Resumo: | This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column selection is modified by a Lagrangean/surrogate multiplier. The efficiency of the new approach is tested with real data, where computational tests were conducted and showed the impact of sparsity and degeneracy on column generation-based methods. © 2017 Wiley. All rights reserved. |
id |
UNSP_4498e46cdfd5a2b2ee9d8064cb72af84 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/225595 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A column generation approach for the maximal covering location problemColumn generationFacility locationLagrangean/surrogate relaxationThis article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column selection is modified by a Lagrangean/surrogate multiplier. The efficiency of the new approach is tested with real data, where computational tests were conducted and showed the impact of sparsity and degeneracy on column generation-based methods. © 2017 Wiley. All rights reserved.FEG/UNESP Department of Mathematics São Paulo State University Engineering College, Guaratinguetá, SP, 12516-410LAC/INPE Associate Laboratory of Applied Mathematics and Computation Brazilian Institute for Space Research, São José dos Campos, SP, 12201-970FEG/UNESP Department of Mathematics São Paulo State University Engineering College, Guaratinguetá, SP, 12516-410Universidade Estadual Paulista (UNESP)Brazilian Institute for Space ResearchPereira, Marcos Antonio [UNESP]Lorena, Luiz Antonio NogueiraSenne, Edson Luiz França [UNESP]2022-04-28T20:55:12Z2022-04-28T20:55:12Z2007-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article349-364http://dx.doi.org/10.1111/j.1475-3995.2007.00593.xInternational Transactions in Operational Research, v. 14, n. 4, p. 349-364, 2007.1475-39950969-6016http://hdl.handle.net/11449/22559510.1111/j.1475-3995.2007.00593.x2-s2.0-68949191944Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengInternational Transactions in Operational Researchinfo:eu-repo/semantics/openAccess2024-07-02T14:29:31Zoai:repositorio.unesp.br:11449/225595Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T22:24:33.161748Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A column generation approach for the maximal covering location problem |
title |
A column generation approach for the maximal covering location problem |
spellingShingle |
A column generation approach for the maximal covering location problem Pereira, Marcos Antonio [UNESP] Column generation Facility location Lagrangean/surrogate relaxation |
title_short |
A column generation approach for the maximal covering location problem |
title_full |
A column generation approach for the maximal covering location problem |
title_fullStr |
A column generation approach for the maximal covering location problem |
title_full_unstemmed |
A column generation approach for the maximal covering location problem |
title_sort |
A column generation approach for the maximal covering location problem |
author |
Pereira, Marcos Antonio [UNESP] |
author_facet |
Pereira, Marcos Antonio [UNESP] Lorena, Luiz Antonio Nogueira Senne, Edson Luiz França [UNESP] |
author_role |
author |
author2 |
Lorena, Luiz Antonio Nogueira Senne, Edson Luiz França [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) Brazilian Institute for Space Research |
dc.contributor.author.fl_str_mv |
Pereira, Marcos Antonio [UNESP] Lorena, Luiz Antonio Nogueira Senne, Edson Luiz França [UNESP] |
dc.subject.por.fl_str_mv |
Column generation Facility location Lagrangean/surrogate relaxation |
topic |
Column generation Facility location Lagrangean/surrogate relaxation |
description |
This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column selection is modified by a Lagrangean/surrogate multiplier. The efficiency of the new approach is tested with real data, where computational tests were conducted and showed the impact of sparsity and degeneracy on column generation-based methods. © 2017 Wiley. All rights reserved. |
publishDate |
2007 |
dc.date.none.fl_str_mv |
2007-01-01 2022-04-28T20:55:12Z 2022-04-28T20:55:12Z |
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.1111/j.1475-3995.2007.00593.x International Transactions in Operational Research, v. 14, n. 4, p. 349-364, 2007. 1475-3995 0969-6016 http://hdl.handle.net/11449/225595 10.1111/j.1475-3995.2007.00593.x 2-s2.0-68949191944 |
url |
http://dx.doi.org/10.1111/j.1475-3995.2007.00593.x http://hdl.handle.net/11449/225595 |
identifier_str_mv |
International Transactions in Operational Research, v. 14, n. 4, p. 349-364, 2007. 1475-3995 0969-6016 10.1111/j.1475-3995.2007.00593.x 2-s2.0-68949191944 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
International Transactions in Operational Research |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
349-364 |
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_ |
1808129424223109120 |