A hybrid Ant algorithm for the set covering problem
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. © 2011 Academic Journals.
Showing items related by title, author, creator and subject.
Conference PaperCrawford B.; Soto R.; Cuesta R.; Paredes F. (Springer Verlag, 2014)
The impact of a new formulation when solving the set covering problem using the ACO metaheuristic (2020) Crawford B.; Soto R.; Palma W.; Paredes F.; Johnson F.; Norero E. (Springer Verlag, 2015)
Conference PaperCuesta R.; Crawford B.; Soto R.; Paredes F. (Springer Verlag, 2014)