A hybrid Ant algorithm for the set covering problem

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

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
Volume6
Issue number19
StatePublished - 1 Jan 2011

Keywords

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

Fingerprint

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

Cite this