Abstract
PurposeFor the solution of equations with sparse matrices, the problem of bandwidth reduction is an important issue. Though graph theoretical algorithms are available, the purpose of this paper is to examine the feasibility of ant systems (AS).Design/methodology/approachFor band optimization an ant colony algorithm based on AS is utilized. In this algorithm a local search procedure is also included to improve the solution.FindingsAS algorithms are found to be suitable for bandwidth optimization.Originality/valueApplication of AS to the bandwidth reduction is the main purpose of this paper, which is successfully performed. The results are compared to those of a graph theoretical bandwidth optimization algorithm.
Subject
Computational Theory and Mathematics,Computer Science Applications,General Engineering,Software
Reference20 articles.
1. Cheng, K.Y. (1973), “Note on minimizing the bandwidth of sparse symmetric matrices”, Computing Journal, Vol. 11, pp. 27‐30.
2. Cuthill, E, and McKee, J. (1969), “Reducing the bandwidth of sparse symmetric matrices”, Proceedings of 24th National Conference on ACM, Bradon System Press, NJ, pp. 157‐72.
3. Dorigo, M., Maniezzo, V. and Colorni, A. (1991), “Ant system: an autocatalytic optimizing process”, Technical Report 91‐016 Revised, Milan.
4. Gibbs, N.E., Poole, W.G. and Stockmeyer P.K. (1976), “An algorithm for reducing the bandwidth and profile of a sparse matrix”, SIAM Journal on Numerical Analysis, Vol. 12, pp. 236‐50.
5. Grimes, R.G., Pierce, D.J. and Simon, H.D. (1990), “A new algorithm for finding a pseudo‐peripheral node in a graph”, SIAM Journal of Analysis and Applications, Vol. 11, pp. 323‐34.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献