TY - GEN
T1 - Enhancing the transition rule in ant computing for the set covering problem
AU - Crawford, Broderick
AU - Castro, Carlos
AU - Monfroy, Eric
PY - 2009
Y1 - 2009
N2 - In this paper, a lookahead mechanism is incorporated in the transition rule of ants solving Set Covering Problem. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization algorithms.
AB - In this paper, a lookahead mechanism is incorporated in the transition rule of ants solving Set Covering Problem. Computational results are presented showing the advantages to use this additional mechanism to Ant Colony Optimization algorithms.
KW - Ant colony optimization
KW - Constraint programming
KW - Lookahead techniques
KW - Set covering problems
KW - Set partitioning problems
UR - http://www.scopus.com/inward/record.url?scp=84904329710&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84904329710
SN - 9783901509704
T3 - Annals of DAAAM and Proceedings of the International DAAAM Symposium
SP - 1329
EP - 1330
BT - Annals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
PB - Danube Adria Association for Automation and Manufacturing, DAAAM
T2 - Annals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
Y2 - 25 November 2009 through 28 November 2009
ER -