Nodal ordering for bandwidth reduction using ant system algorithm

Abstract

Purpose

For 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/approach

For 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.

Findings

AS algorithms are found to be suitable for bandwidth optimization.

Originality/value

Application 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.

Citation

Kaveh, A. and Sharafi, P. (2009), "Nodal ordering for bandwidth reduction using ant system algorithm", Engineering Computations, Vol. 26 No. 3, pp. 313-323. https://doi.org/10.1108/02644400910943644