An improved heuristic for the bandwidth minimization based on genetic programming

Authors:
P. C. Pop;O. Matei
Affiliations:
Dept. of Mathematics and Informatics, North University of Baia Mare, Romania;Dept. of Electrical Engineering, North University of Baia Mare, Romania
Venue:
HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part II
Year:
2011

Citing 5
Cited 0

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

Genetic programming: on the programming of computers by means of natural selection
Finding exact solutions to the bandwidth minimization problem

Computing
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem

Applied Intelligence
A genetic programming approach to the matrix bandwidth-minimization problem

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we develop an improved heuristic based on genetic programming (GP) for the matrix bandwidth minimization problem (MBMP). This problem consists in rearranging the rows and columns of a sparse matrix such that the non-zero elements are in a band as close as possible to the main diagonal. We evaluated our heuristic on a set of 25 benchmark instances from the literature and compared with state-of-the-art algorithms. The obtained results are very encouraging and point out that GP is an appropriate method for solving the MBMP.