Reducing the bandwidth of a sparse matrix with a genetic algorithm

Abstract The matrix bandwidth minimization problem (MBMP) consists in finding a permutation of the lines and columns of a given sparse matrix in order to keep the non-zero elements in a band that is as close as possible to the main diagonal. Equivalently in terms of graph theory, MBMP is defined as the problem of finding a labelling of the vertices of a given graph G such that its bandwidth is minimized. In this paper, we propose an improved genetic algorithm (GA)-based heuristic for solving the matrix bandwidth minimization problem, motivated by its robustness and efficiency in a wide area of optimization problems. Extensively computational results are reported for an often used set of benchmark instances. The obtained results on the different instances investigated show improvement of the quality of the solutions and demonstrate the efficiency of our GA compared to the existing methods in the literature.

[1]  Camelia-Mihaela Pintea,et al.  A Hybrid ACO Approach to the Matrix Bandwidth Minimization Problem , 2010, HAIS.

[2]  Riccardo Poli,et al.  A Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem , 2010, PPSN.

[3]  Andrew Lim,et al.  Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem , 2006, Applied Intelligence.

[4]  Andrew Lim,et al.  Heuristics for matrix bandwidth reduction , 2006, Eur. J. Oper. Res..

[5]  Luciano Tarricone,et al.  Parallel Heuristics for Bandwidth Reduction of Sparse Matrices with IBM SP2 and Cray T3D , 1996, PARA.

[6]  Francesco Romani,et al.  Heuristic Spectral Techniques for the Reduction of Bandwidth and Work-Bound of Sparse Matrices , 2001, Numerical Algorithms.

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[9]  Yung-Ling Lai,et al.  A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs , 1999 .

[10]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[11]  Kenneth Williams,et al.  A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs , 1999, J. Graph Theory.

[12]  H. D. Simon,et al.  A spectral algorithm for envelope reduction of sparse matrices , 1993, Supercomputing '93. Proceedings.

[13]  Ilya Safro,et al.  Multilevel algorithms for linear ordering problems , 2009, JEAL.

[14]  Tzung-Pei Hong,et al.  Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms , 2000, J. Heuristics.

[15]  José Torres-Jiménez,et al.  An improved simulated annealing algorithm for bandwidth minimization , 2008, Eur. J. Oper. Res..

[16]  Giovanni Manzini,et al.  Finding Exact Solutions to the Bandwidth Minimization Problem , 1999, Computing.

[17]  E. Cuthill,et al.  Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.

[18]  Petrica C. Pop,et al.  An Improved Heuristic for the Bandwidth Minimization Based on Genetic Programming , 2011, HAIS.

[19]  Fred W. Glover,et al.  Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..

[20]  Isaac Plana,et al.  GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..

[21]  Dragan Urosevic,et al.  Variable neighbourhood search for bandwidth reduction , 2008, Eur. J. Oper. Res..

[22]  Andrew Lim,et al.  Ant colony optimization with hill climbing for the bandwidth minimization problem , 2006, Appl. Soft Comput..

[23]  Riccardo Poli,et al.  A Hyper-Heuristic Approach to Evolving Algorithms for Bandwidth Reduction Based on Genetic Programming , 2011, SGAI Conf..

[24]  Rafael Martí,et al.  A branch and bound algorithm for the matrix bandwidth minimization , 2008, Eur. J. Oper. Res..