A hybrid ACO approach to the matrix bandwidth minimization problem

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The evolution of the human society raises more and more difficult endeavors. For some of the real-life problems, the computing time-restriction enhances their complexity. The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous permutation of the rows and the columns of a square matrix in order to keep its nonzero entries close to the main diagonal. The MBMP is a highly investigated -complete problem, as it has broad applications in industry, logistics, artificial intelligence or information recovery. This paper describes a new attempt to use the Ant Colony Optimization framework in tackling MBMP. The introduced model is based on the hybridization of the Ant Colony System technique with new local search mechanisms. Computational experiments confirm a good performance of the proposed algorithm for the considered set of MBMP instances. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Pintea, C. M., Crişan, G. C., & Chira, C. (2010). A hybrid ACO approach to the matrix bandwidth minimization problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6076 LNAI, pp. 405–412). https://doi.org/10.1007/978-3-642-13769-3_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free