Title :
A New ACO Transition Rule for Set Partitioning and Covering Problems
Author :
Crawford, Broderick ; Castro, Carlos ; Monfroy, Eric
Author_Institution :
Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile
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.
Keywords :
computational complexity; optimisation; set theory; ACO transition rule; ant colony optimization; lookahead mechanism; set covering problems; set partitioning problems; Ant colony optimization; Cost function; Job shop scheduling; Labeling; Mathematical model; Mathematical programming; Partitioning algorithms; Pattern recognition; Testing; Ant Colony Optimization; Lookahead Techniques; Set Covering Problem; Set Partitioning Problem;
Conference_Titel :
Soft Computing and Pattern Recognition, 2009. SOCPAR '09. International Conference of
Conference_Location :
Malacca
Print_ISBN :
978-1-4244-5330-6
Electronic_ISBN :
978-0-7695-3879-2
DOI :
10.1109/SoCPaR.2009.89
