TY - GEN
T1 - A new ACO transition rule for set partitioning and covering problems
AU - Crawford, Broderick
AU - Castro, Carlos
AU - Monfroy, Eric
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
KW - Ant colony optimization
KW - Lookahead techniques
KW - Set covering problem
KW - Set partitioning problem
UR - http://www.scopus.com/inward/record.url?scp=77649314825&partnerID=8YFLogxK
U2 - 10.1109/SoCPaR.2009.89
DO - 10.1109/SoCPaR.2009.89
M3 - Conference contribution
AN - SCOPUS:77649314825
SN - 9780769538792
T3 - SoCPaR 2009 - Soft Computing and Pattern Recognition
SP - 426
EP - 429
BT - SoCPaR 2009 - Soft Computing and Pattern Recognition
T2 - International Conference on Soft Computing and Pattern Recognition, SoCPaR 2009
Y2 - 4 December 2009 through 7 December 2009
ER -