Skip to main content
SpringerLink
Log in

A Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem

  • Conference paper
Parallel Problem Solving from Nature, PPSN XI (PPSN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6239))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnard, S.T., Pothen, A., Simon, H.D.: A spectral algorithm for envelope reduction of sparse matrices. In: Supercomputing 1993: Proceedings of the 1993 ACM/IEEE Conference on Supercomputing, pp. 493–502. ACM, New York (1993)

    Chapter  Google Scholar 

  2. Corso, G.D., Manzini, G.: Finding exact solutions to the bandwidth minimization problem. Computing 62(3), 189–203 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: ACM National Conference, pp. 157–172. Association for Computing Machinery, New York (1969)

    Google Scholar 

  4. Esposito, A., Malucelli, F., Tarricone, L.: Bandwidth and profile reduction of sparse matrices: An experimental comparison of new heuristics. In: ALEX 1998, Trento, Italy, pp. 19–26 (1998)

    Google Scholar 

  5. Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM Journal on Applied Mathematics 34(3), 477–495 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  6. George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)

    MATH  Google Scholar 

  7. Gibbs, N.E., Poole, W.G., Stockmeyer, P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis 13(2), 236–250 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gurari, E., Sudborough, I.: Improved dynamic programming algorithms for bandwidth minimization and the min-cut linear arrangement problem. Journal of Algorithms 5, 531–546 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  9. Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)

    Google Scholar 

  10. Koohestani, B., Corne, D.: An improved fitness function and mutation operator for metaheuristic approaches to the bandwidth minimization problem. In: Proceedings of the 1st International Conference on Bio-Inspired Computational (BICS), AIP Conference Proceedings, vol. 1117, pp. 21–28 (2009)

    Google Scholar 

  11. Koza, J.R.G.P.: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  12. Lim, A., Lin, J., Rodrigues, B., Xiao, F.: Ant colony optimization with hill climbing for the bandwidth minimization problem. Applied Soft Computing 6(2), 180–188 (2006)

    Article  Google Scholar 

  13. Lim, A., Lin, J., Xiao, F.: Particle swarm optimization and hill climbing for the bandwidth minimization problem. Applied Intelligence 26(3), 175–182 (2007)

    Article  MATH  Google Scholar 

  14. Lim, A., Rodrigues, B., Xiao, F.: Integrated genetic algorithm with hill climbing for bandwidth minimization problem. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1594–1595. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Lim, A., Rodrigues, B., Xiao, F.: A centroid-based approach to solve the bandwidth minimization problem. In: 37th Hawaii International Conference on System Sciences (HICSS), Big Island, Hawaii, p. 30075a (2004)

    Google Scholar 

  16. Lim, A., Rodrigues, B., Xiao, F.: A genetic algorithm with hill climbing for the bandwidth minimization problem, available from Citeseer-X (2002)

    Google Scholar 

  17. Marti, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research 135(2), 450–459 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16(3), 263–270 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  19. Pissanetskey, S.: Sparse Matrix Technology. Academic Press, London (1984)

    Google Scholar 

  20. Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming with contributions by J. R. Koza (2008), Published via http://lulu.com

  21. Rodriguez-Tello, E., Jin-Kao, H., Torres-Jimenez, J.: An improved simulated annealing algorithm for bandwidth minimization. European Journal of Operational Research 185(3), 1319–1335 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Electronic Engineering, University of Essex, CO4 3SQ, UK

    Behrooz Koohestani & Riccardo Poli

Authors
  1. Behrooz Koohestani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Riccardo Poli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Electrical Engineering, Automatics, Computer Science and Electronics, Department of ComputerScience, AGH University of Science and Technology, Mickiewicza 30, 30-059, Kraków, Poland

    Robert Schaefer

  2. Departamento de Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Campus Teatinos, 29071, Málaga, Spain

    Carlos Cotta

  3. Department of Mathematics and Computer Science, University of Bielsko-Biala, Willowa 2, 43-309, Bielsko-Biala, Poland

    Joanna Kołodziej

  4. Fakultät für Informatik, Technische Universität Dortmund, 44221, Dortmund, Germany

    Günter Rudolph

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koohestani, B., Poli, R. (2010). A Genetic Programming Approach to the Matrix Bandwidth-Minimization Problem. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15871-1_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15871-1_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15870-4

  • Online ISBN: 978-3-642-15871-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation