A hybrid Ant algorithm for the set covering problem

Broderick Crawford, Ricardo Soto, Eric Monfroy, Fernando Paredes, Wenceslao Palma

Research output: Contribution to journalArticlepeer-review

15 Scopus citations


Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use this additional mechanism to ant system and ant colony system.

Original languageEnglish
Pages (from-to)4667-4673
Number of pages7
JournalInternational Journal of Physical Sciences
Issue number19
StatePublished - 16 Sep 2011


  • Ant colony optimization
  • Look-ahead techniques
  • Set covering problem


Dive into the research topics of 'A hybrid Ant algorithm for the set covering problem'. Together they form a unique fingerprint.

Cite this