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.
