A New ACO Transition Rule for Set Partitioning and Covering Problems

Broderick Crawford,Eric Monfroy,Carlos Castro

doi:10.1109/socpar.2009.89

A New ACO Transition Rule for Set Partitioning and Covering Problems

Broderick Crawford, Eric Monfroy + Show 1 more

https://doi.org/10.1109/socpar.2009.89

Copy DOI

Publication Date: Jan 1, 2009

Citations: 19

Affiliation: Federico Santa María Technical University, Nantes Université, Pontificial Catholic University of Valparaiso

#Set Partitioning Problem #Set Covering + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

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.

Full Text