چكيده لاتين :
In this paper a simple ant algorithm based on ant system is proposed for nodal ordering problem to reduce the profile of sparse matrices. In this algorithm, a local search procedure is also included to further improve the profiles. The results are compared to those of a graph theoretical profile optimization algorithm. Examples are included to illustrate the
performance of the present approach.
