Skip to main content
SpringerLink
Log in

Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

In this paper, the problem of reducing the bandwidth of sparse matrices by permuting rows and columns is addressed and solved with a new hybrid heuristic which combines the Particle Swarm Optimization method with Hill Climbing (PSO-HC). This hybrid approach exploits a compact PSO in order to generate high-quality renumbering which is then refined by means of an efficient implementation of the HC local search heuristic. Computational experiments are carried out to compare the performance of PSO-HC with the well-known GPS algorithm, as well as some recently proposed methods, including WBRA, Tabu Search and GRASP_PR. PSO-HC proves to be extremely stable and reliable in finding good solutions to the bandwidth minimization problem, outperforming the currently known best algorithms in terms of solution quality, in reasonable computational time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Papadimitriou CH (1976) The NP-completeness of the bandwidth minimization problem. Computing 16:263–270

    Article  MATH  MathSciNet  Google Scholar 

  2. Unger W (1998) The complexity of the approximation of the bandwidth problem. 37th annual symposium on foundations of computer science, pp 82–91

  3. CutHill E, McKee J (1969) Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the ACM national conference. Association for computing machinery, New York, pp 157–172

  4. King IP (1970) An automatic reordering schema for simultaneous equations derived from network system. Int J Numer Meth Eng 2:523–533

    Article  Google Scholar 

  5. Gibbs NE, Poole WG, Stockmeyer PK (1976) An algorithm for reducing the bandwidth and profile of sparse matrix. SIAM J Numer Anal 13(2):236–250

    Article  MATH  MathSciNet  Google Scholar 

  6. Marti R, Laguna M, Glover F, Campos V (2001) Reducing the bandwidth of a sparse matrix with Tabu Search. Eur J Operat Res 135(2):211–220

    Article  MathSciNet  Google Scholar 

  7. Pinana E, Plana I, Campos V, Marti R (2004) GRASP and path relinking for the matrix bandwidth minimization. Eur J Operat Res 153(1):200–210

    Article  MATH  MathSciNet  Google Scholar 

  8. Kennedy J, Eberhart R (1995) Particle Swarm Optimization. In: IEEE international conference on neural networks (Perth, Australia). IEEE Service Center, Piscataway, NJ, vol IV, pp 1942–1948

  9. Esposito A, Catalano MSF, Malucelli F, Tarricone L (1999) Sparse matrix bandwidth reduction: algorithms, applications and real industrial cases in electromagnetics. In: Paprzyky M (ed) High performance algorithms for structured matrix problems.

  10. Kennedy J, Eberhart R (1997) A discrete binary version of particle swarm algorithm. In: 1997 IEEE conference on systems, man, and cybernetics. Orlando, FL, pp 4104–4109

  11. Shi YH, Eberhart RC (1998) Parameter selection in particle swarm optimization. In: Seventh annual conference on evolutionary programming, San Diego, CA

  12. Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Boston

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Andrew Lim

  2. Department of Computer Science, National University of Singapore, 3 Science Drive 2, 117543, Singapore, Singapore

    Jing Lin & Fei Xiao

Authors
  1. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fei Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lim, A., Lin, J. & Xiao, F. Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem. Appl Intell 26, 175–182 (2007). https://doi.org/10.1007/s10489-006-0019-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-006-0019-x

Keywords

Search

Navigation