Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy
Autor(a) principal: | |
---|---|
Data de Publicação: | 2021 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFLA |
Texto Completo: | http://repositorio.ufla.br/jspui/handle/1/49132 |
Resumo: | This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising from specific application areas. Specifically, this paper uses low-cost state-of-the-art heuristics for bandwidth reduction in tandem with a Hill-Climbing procedure. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed strategy outperformed low-cost state-of-the-art heuristics for bandwidth reduction when applied to matrices with symmetric sparsity patterns. |
id |
UFLA_2d4333b3e8f5f616adc3c5282ae3019a |
---|---|
oai_identifier_str |
oai:localhost:1/49132 |
network_acronym_str |
UFLA |
network_name_str |
Repositório Institucional da UFLA |
repository_id_str |
|
spelling |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategyBandwidth reductionSparse matrixAnt colony optimizationHyper-heuristicReordering algorithmsHill-Climbing procedureRedução da largura de bandaMatriz esparsaOtimização de colônia de formigasHiper-heurísticaAlgoritmos de reordenaçãoThis paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising from specific application areas. Specifically, this paper uses low-cost state-of-the-art heuristics for bandwidth reduction in tandem with a Hill-Climbing procedure. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed strategy outperformed low-cost state-of-the-art heuristics for bandwidth reduction when applied to matrices with symmetric sparsity patterns.EDP Sciences2022-02-02T16:48:01Z2022-02-02T16:48:01Z2021info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfOLIVEIRA, S. L. G. de; SILVA, L. M. Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. RAIRO-Operations Research, Montreuil, v. 55, n. 4, p. 2247-2264, July/Aug. 2021. DOI: 10.1051/ro/2021102.http://repositorio.ufla.br/jspui/handle/1/49132RAIRO-Operations Researchreponame:Repositório Institucional da UFLAinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAAttribution 4.0 Internationalhttp://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessOliveira, Sanderson L. Gonzaga deSilva, Libério M.eng2022-02-02T16:48:01Zoai:localhost:1/49132Repositório InstitucionalPUBhttp://repositorio.ufla.br/oai/requestnivaldo@ufla.br || repositorio.biblioteca@ufla.bropendoar:2022-02-02T16:48:01Repositório Institucional da UFLA - Universidade Federal de Lavras (UFLA)false |
dc.title.none.fl_str_mv |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
title |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
spellingShingle |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy Oliveira, Sanderson L. Gonzaga de Bandwidth reduction Sparse matrix Ant colony optimization Hyper-heuristic Reordering algorithms Hill-Climbing procedure Redução da largura de banda Matriz esparsa Otimização de colônia de formigas Hiper-heurística Algoritmos de reordenação |
title_short |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
title_full |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
title_fullStr |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
title_full_unstemmed |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
title_sort |
Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy |
author |
Oliveira, Sanderson L. Gonzaga de |
author_facet |
Oliveira, Sanderson L. Gonzaga de Silva, Libério M. |
author_role |
author |
author2 |
Silva, Libério M. |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Oliveira, Sanderson L. Gonzaga de Silva, Libério M. |
dc.subject.por.fl_str_mv |
Bandwidth reduction Sparse matrix Ant colony optimization Hyper-heuristic Reordering algorithms Hill-Climbing procedure Redução da largura de banda Matriz esparsa Otimização de colônia de formigas Hiper-heurística Algoritmos de reordenação |
topic |
Bandwidth reduction Sparse matrix Ant colony optimization Hyper-heuristic Reordering algorithms Hill-Climbing procedure Redução da largura de banda Matriz esparsa Otimização de colônia de formigas Hiper-heurística Algoritmos de reordenação |
description |
This paper studies heuristics for the bandwidth reduction of large-scale matrices in serial computations. Bandwidth optimization is a demanding subject for a large number of scientific and engineering applications. A heuristic for bandwidth reduction labels the rows and columns of a given sparse matrix. The algorithm arranges entries with a nonzero coefficient as close to the main diagonal as possible. This paper modifies an ant colony hyper-heuristic approach to generate expert-level heuristics for bandwidth reduction combined with a Hill-Climbing strategy when applied to matrices arising from specific application areas. Specifically, this paper uses low-cost state-of-the-art heuristics for bandwidth reduction in tandem with a Hill-Climbing procedure. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed strategy outperformed low-cost state-of-the-art heuristics for bandwidth reduction when applied to matrices with symmetric sparsity patterns. |
publishDate |
2021 |
dc.date.none.fl_str_mv |
2021 2022-02-02T16:48:01Z 2022-02-02T16:48:01Z |
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 |
OLIVEIRA, S. L. G. de; SILVA, L. M. Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. RAIRO-Operations Research, Montreuil, v. 55, n. 4, p. 2247-2264, July/Aug. 2021. DOI: 10.1051/ro/2021102. http://repositorio.ufla.br/jspui/handle/1/49132 |
identifier_str_mv |
OLIVEIRA, S. L. G. de; SILVA, L. M. Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy. RAIRO-Operations Research, Montreuil, v. 55, n. 4, p. 2247-2264, July/Aug. 2021. DOI: 10.1051/ro/2021102. |
url |
http://repositorio.ufla.br/jspui/handle/1/49132 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
Attribution 4.0 International http://creativecommons.org/licenses/by/4.0/ info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Attribution 4.0 International http://creativecommons.org/licenses/by/4.0/ |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
EDP Sciences |
publisher.none.fl_str_mv |
EDP Sciences |
dc.source.none.fl_str_mv |
RAIRO-Operations Research reponame:Repositório Institucional da UFLA instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
Repositório Institucional da UFLA |
collection |
Repositório Institucional da UFLA |
repository.name.fl_str_mv |
Repositório Institucional da UFLA - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
nivaldo@ufla.br || repositorio.biblioteca@ufla.br |
_version_ |
1784550053365415936 |