Evolving an Improved Algorithm for Envelope Reduction Using a Hyper-Heuristic Approach

Behrooz Koohestani

doi:10.1109/TEVC.2013.2281512

Return

Evolving an Improved Algorithm for Envelope Reduction Using a Hyper-Heuristic Approach

2014-08-01

PRE

Behrooz Koohestani *

Riccardo Poli

DOI：10.1109/TEVC.2013.2281512

Original

Original request for help

Save

Abstract

En 中文

Large sparse symmetric matrices are typical characteristics of the linear systems found in various scientific and engineering disciplines, such as fluid mechanics, structural engineering, finite element analysis, and network analysis. In all such systems, the performance of solvers crucially depends on the sum of the distance of each matrix element from the matrix's main diagonal. This quantity is known as the envelope. In order to reduce the envelope of a matrix, its rows and columns should be reordered properly. The problem of minimizing the envelope size is exceptionally hard and known to be NP-complete. A considerable number of methods have been developed for reducing the envelope among which the Sloan algorithm offered a substantial improvement over previous algorithms. In this paper, a hyper-heuristic approach based on genetic programming, which we term genetic hyper-heuristic, is introduced for evolving an enhanced version of the Sloan algorithm. We also present a local search algorithm and integrate it with the new algorithm produced by our hyper-heuristic to further improve the quality of the solutions. The new algorithms are evaluated on a large set of standard benchmarks against six state-of-the-art algorithms from the literature. Our algorithms outperform all the methods under testing by a wide margin.

Keywords:

Genetic programming

graph theory

optimization

search methods

sparse matrices

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.