A genetic programming approach to the matrix bandwidth-minimization problem

Authors:
Behrooz Koohestani;Riccardo Poli
Affiliations:
School of Computer Science and Electronic Engineering, University of Essex, UK;School of Computer Science and Electronic Engineering, University of Essex, UK
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 10
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
A spectral algorithm for envelope reduction of sparse matrices

Proceedings of the 1993 ACM/IEEE conference on Supercomputing
Finding exact solutions to the bandwidth minimization problem

Computing
Computer Solution of Large Sparse Positive Definite

Computer Solution of Large Sparse Positive Definite
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem

HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3
Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem

Applied Intelligence
Ant colony optimization with hill climbing for the bandwidth minimization problem

Applied Soft Computing
Integrated genetic algorithm with hill climbing for bandwidth minimization problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming

An improved heuristic for the bandwidth minimization based on genetic programming

HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The bandwidth of a sparse matrix is the distance from the main diagonal beyond which all elements of the matrix are zero. The bandwidth minimisation problem for a matrix consists of finding the permutation of rows and columns of the matrix which ensures that the non-zero elements are located in as narrow a band as possible along the main diagonal. This problem, which is known to be NP-complete, can also be formulated as a vertex labelling problem for a graph whose edges represent the non-zero elements of the matrix. In this paper, a Genetic Programming approach is proposed and tested against two of the best-known and widely used bandwidth reduction algorithms. Results have been extremely encouraging.