Using an evolutionary algorithm for bandwidth minimization

2003 Congress on Evolutionary Computation, CEC 2003 - Proceedings

Volumn 1, Issue , 2003, Pages 678-683

  Lim, Andrew ^a   Rodrigues, Brian ^b   Xiao, Fei ^c  

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

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; GENETIC ALGORITHMS; TABU SEARCH;

BANDWIDTH MINIMIZATION; BANDWIDTH MINIMIZATION PROBLEM; GLOBAL SEARCH; HILL CLIMBING; LOCAL SEARCH; PATH RELINKING; SOLUTION QUALITY;

ALGORITHMS;

EID: 33751051869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2003.1299641     Document Type: Conference Paper

References (16)

1. Arany I., Smyth, W., F., Szoda, L., 1971, An imporved method for reducing the bandwidth of sparse symmetric matrices, Proc. IFIP Conference, Nonh-Holland, Amsterdam, pp: 1246-1250.
2. Berry, M., Hendrickson, B., Raghavan, P., 1996 Sparse matrix reordering schedmes for browsing hypertext. In S. Smale J. Renegar, M. Shub, Editor. Lectures in Appl. Math. 32: The Mathematics of Numberical Analysis, pp. 99-123, AMS. Providence, RI.
3. Chinn, P., Chvatalova, J., Dewdney, A. K., and Gibbs, N. E., 1982. The bandwidth problem for graphs and matrices - a survey. J. Graph Theory, 6:223-254, 1982
4. Cuthill, E., McKee, J., 1969, Reducing the bandwidth of sparse symmetric matrices. In: Proceed ings of the ACM National Conference, Association for Computing Machinery. New York, pp. 157-172
5. Del Corso, G. and Manzini, G. 1999, Finding exact solutions to the bandwidth minization problem, Computing, 62, pp. 189-203
6. Dueck. G. H., Jeffs. J., 1995, A heuristic bandwidth reduction algorithm. Journal of Combinatorial Mathematics and Combinatorial Computing. 18, pp 97-108
7. Esposito, A., Catalano, M., S., Malucelli F., Tarricone, L. 1998. Sparse Matrix Bandwidth Reduction: Algorithms, applications and real industrial cases in electromagnetics, 1998. High Performance Algorithms for Structured Matrix Problems, Advances in the theory of Computation and Computational Mathematics Volume 2, pp. 27-45.
8. Esposito, A., Catalano. M., S., Malucelli F., Tarricone. L. 1998. A new matrix bandwidth reduction algorithm. 1998. Operation Research Letters 23, pp. 99-107
9. Garey, M., Graham, R., Johnson, D., Knuth, D., 1978. Complexity results for bandwidth minimization. SIAM J, Appl. Math., 34:477-495, 1978.
10. 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.
11. Glover, F., Laguna, M" 1997, Tabu Search. Kluwer Academic Publishers, Boston.
12. Holland, J. H., 1975, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
13. Luo, J. C., 1992. Algorithms for reducing the bandwidth and profile of a sparse matrix. Computers and Structures 44. 535-548.
14. Marti, R., Laguna, M., Glover. F. and Campos, V., 2001. Reducing the Bandwidth of a Sparse Matrix with Tabu Search. European Journal of Oper ational Research, 135(2), pp. 211-220.
15. Papadimitriou, C. H., 1976, The NP-completeness of the bandwidth minimization problem. Computing. 16:263-270.
16. Pinana, E., Plana. I., Campos, V., Marti, R., 2002, in print, European Journal.of Operational Research. http://www.uv. es/rmarti/.