A New ACO Transition Rule for Set Partitioning and Covering Problems
Broderick Crawford, Carlos Castro, Éric Monfroy · 2009
Set Covering Problem and Set Partitioning Problem are models for many important industrial applications. In this paper, we solve some Operational Research benchmarks with Ant Colony Optimization using a new transition rule. A Lookahead mechanism was incorporated to check constraint consistency in each iteration. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization.