An ant colony hyperheuristic approach for matrix bandwidth reduction

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorOliveira, S.L. Gonzaga de-
Autor(es): dc.creatorSilva, L.M.-
Data de aceite: dc.date.accessioned2026-02-09T12:23:28Z-
Data de disponibilização: dc.date.available2026-02-09T12:23:28Z-
Data de envio: dc.date.issued2021-09-13-
Data de envio: dc.date.issued2021-09-13-
Data de envio: dc.date.issued2020-09-
Fonte completa do material: dc.identifierhttps://repositorio.ufla.br/handle/1/48111-
Fonte completa do material: dc.identifierhttps://doi.org/10.1016/j.asoc.2020.106434-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/1160334-
Descrição: dc.descriptionThis paper considers the bandwidth reduction problem for large-scale matrices in serial computations. A heuristic for bandwidth reduction reorders the rows and columns of a given sparse matrix so that the method places entries with a nonzero value as close to the main diagonal as possible. Bandwidth optimization is a critical issue for many scientific and engineering applications. In this regard, this paper proposes an ant colony hyperheuristic approach for the bandwidth reduction of symmetric and nonsymmetric matrices. The ant colony hyperheuristic approach evolves and selects graph theory bandwidth reduction algorithms for application areas. This paper evaluates the resulting heuristics for bandwidth reduction in each application area against the most promising low-cost heuristics for bandwidth reduction. This paper also includes a numerical examination of the current state-of-the-art metaheuristic algorithms for matrix bandwidth reduction. The results yielded on a wide-ranging set of standard benchmark matrices showed that the proposed approach outperformed state-of-the-art low-cost heuristics for bandwidth reduction when applied to problem cases arising from several application areas, clearly indicating the promise of the proposal.-
Idioma: dc.languageen-
Publicador: dc.publisherElsevier-
Direitos: dc.rightsrestrictAccess-
???dc.source???: dc.sourceApplied Soft Computing-
Palavras-chave: dc.subjectBandwidth reduction-
Palavras-chave: dc.subjectSparse matrix-
Palavras-chave: dc.subjectAnt colony optimization-
Palavras-chave: dc.subjectHyperheuristic-
Palavras-chave: dc.subjectReordering algorithms-
Palavras-chave: dc.subjectRenumbering-
Palavras-chave: dc.subjectGraph labeling-
Palavras-chave: dc.subjectGraph algorithm-
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.subjectHiperheurística-
Palavras-chave: dc.subjectAlgoritmos de reordenação-
Palavras-chave: dc.subjectRenumeração-
Palavras-chave: dc.subjectRotulagem de gráfico-
Palavras-chave: dc.subjectAlgoritmo gráfico-
Título: dc.titleAn ant colony hyperheuristic approach for matrix bandwidth reduction-
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.