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.
|Number of pages||7|
|Journal||International Journal of Physical Sciences|
|State||Published - 1 Jan 2011|
- Ant colony optimization
- Look-ahead techniques
- Set covering problem