BANDWIDTH OPTIMIZATION USING CBO AND ECBO

In this paper two recently developed meta-heuristic optimization methods, known as Colliding Bodies Optimization (CBO) and Enhanced Colliding Bodies Optimization (ECBO), are used for optimum nodal ordering to minimize bandwidth of sparse matrices. The CBO is a simple optimization algorithm which is inspired by a collision between two objects in one-dimension. Each agent is modeled as a body with a specified velocity and mass. A collision happens between pairs of bodies and the new positions of the colliding bodies are updated based on the collision laws. The enhanced colliding bodies optimization (ECBO) utilizes memory to save some best so-far-solution to improve the performance of the CBO without increasing the computational cost. This algorithm utilizes a mechanism to escape from local optima. The bandwidth of some graph matrices, which have equivalent pattern to structural matrices, is minimized using these approaches. Comparison of the obtained results with those of some existing methods shows the robustness of these two new meta-heuristic algorithms for bandwidth optimization.