A hybrid Ant algorithm for the set covering problem

International Journal of Physical Sciences

Broderick Crawford¹ 

关键词: Set covering problem;    ant colony optimization;    look-ahead techniques.;   

DOI  :  10.5897/IJPS11.771

学科分类：物理（综合）

来源: Academic Journals

【 摘 要 】

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.

【 授权许可】

CC BY