Low-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, Sanderson L. Gonzaga de-
Autor(es): dc.creatorSilva, Libério M.-
Data de aceite: dc.date.accessioned2026-02-09T11:42:00Z-
Data de disponibilização: dc.date.available2026-02-09T11:42:00Z-
Data de envio: dc.date.issued2022-02-01-
Data de envio: dc.date.issued2022-02-01-
Data de envio: dc.date.issued2020-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/49132-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1145491-
Descrição: dc.descriptionThis 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.-
Formato: dc.formatapplication/pdf-
Idioma: dc.languageen-
Publicador: dc.publisherEDP Sciences-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightsAttribution 4.0 International-
Direitos: dc.rightsacesso aberto-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
Direitos: dc.rightshttp://creativecommons.org/licenses/by/4.0/-
???dc.source???: dc.sourceRAIRO-Operations Research-
Palavras-chave: dc.subjectBandwidth reduction-
Palavras-chave: dc.subjectSparse matrix-
Palavras-chave: dc.subjectAnt colony optimization-
Palavras-chave: dc.subjectHyper-heuristic-
Palavras-chave: dc.subjectReordering algorithms-
Palavras-chave: dc.subjectHill-Climbing procedure-
Palavras-chave: dc.subjectRedução da largura de banda-
Palavras-chave: dc.subjectMatriz esparsa-
Palavras-chave: dc.subjectOtimização de colônia de formigas-
Palavras-chave: dc.subjectHiper-heurística-
Palavras-chave: dc.subjectAlgoritmos de reordenação-
Título: dc.titleLow-cost heuristics for matrix bandwidth reduction combined with a Hill-Climbing strategy-
Tipo de arquivo: dc.typeArtigo-
Aparece nas coleções:Repositório Institucional da Universidade Federal de Lavras (RIUFLA)

Não existem arquivos associados a este item.