DocumentCode
2903267
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
fYear
2009
fDate
4-7 Dec. 2009
Firstpage
426
Lastpage
429
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;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/SoCPaR.2009.89
Filename
5368630
Link To Document