Skip to main content

Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Abstract

In this paper, we propose an integrated Genetic Algorithm with Hill Climbing to solve the matrix bandwidth minimization problem, which is to reduce bandwidth by permuting rows and columns resulting in the nonzero elements residing in a band as close as possible to the diagonal. Experiments show that this approach achieves the best solution quality when compared with the GPS [1] algorithm, Tabu Search [3], and the GRASP with Path Relinking methods [4], while being faster than the latter two newly-developed heuristics.

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

Buying options

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

Learn about institutional subscriptions

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Holland, J.H., 1975, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.

    MATH  Google Scholar 

  3. Marti, R., Laguna, M., Glover, F. and Campos, V., 2001, Reducing the Bandwidth of a Sparse Matrix with Tabu Search, European Journal of Operational Research, 135(2), pp. 211–220.

    Article  MathSciNet  Google Scholar 

  4. Pinana, E., Plana, I., Campos, V. Marti, R., 2002, in print, European Journal of Operational Research. http://www.uv.es/~rmarti/.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, A., Brian, R., Xiao, F. (2003). Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics