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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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.
Holland, J.H., 1975, Adaption in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
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.
Pinana, E., Plana, I., Campos, V. Marti, R., 2002, in print, European Journal of Operational Research. http://www.uv.es/~rmarti/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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