BIO-INSPIRED COMPONENTS FOR A BANDWIDTH PROBLEM
CAMELIA-M. PINTEA(1), ANDREEA VEŞCAN(2)
1. “G. Coşbuc” National College, Cluj-Napoca, Romania, e-mail: cmpintea@yahoo.com 2.Department of Computer Science, Faculty of Mathematics and Computer, Babes-Bolyai University, Cluj-Napoca, Romania, e-mail: avescan@cs.ubbcluj.ro
Abstract
In this paper are illustrated some specific bio-inspired component for solving a combinatorial optimization problem: The Matrix Bandwidth Minimization Problem(MBMP). The described components are based on a hybrid model of the Ant Colony System technique with new local search mechanisms [4]. MBMP seeks for a simultaneous permutation of the rows and also of the columns of a square matrix in order to keep its nonzero entries close to the main diagonal.