Particle swarm optimization and hill climbing for the bandwidth minimization problem

Applied Intelligence

Volumn 26, Issue 3, 2007, Pages 175-182

  Lim, Andrew ^a   Lin, Jing ^b   Xiao, Fei ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bandwidth minimization; Hill climbing; Particle Swarm Optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GLOBAL OPTIMIZATION; HEURISTIC METHODS; PROBLEM SOLVING; TABU SEARCH;

BANDWIDTH MINIMIZATION; HILL CLIMBING; PARTICLE SWARM OPTIMIZATION; SPARSE MATRICES;

BANDWIDTH;

EID: 34247121120     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10489-006-0019-x     Document Type: Article

References (12)

1. Papadimitriou CH (1976) The NP-completeness of the bandwidth minimization problem. Computing 16:263-270
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
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
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
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
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