Paper Info
Title
A New ACO Transition Rule for Set Partitioning and Covering Problems
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.
Year
DOI
Venue
2009
10.1109/SoCPaR.2009.89
Malacca
Keywords
Field
DocType
new transition rule,computational result,operational research benchmarks,ant colony optimization,additional mechanism,lookahead mechanism,covering problems,set covering problem,important industrial application,new aco transition rule,set partitioning problem,constraint consistency,programming,benchmark testing,data mining,operations research,computational complexity,set theory
Ant colony optimization algorithms,Set cover problem,Computer science,Artificial intelligence,Check constraint,Benchmark (computing),Covering problems,Set theory,Mathematical optimization,Algorithm,Selection rule,Machine learning,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
978-0-7695-3879-2
2
0.39
References 
Authors
10
3
Name
Order
Citations
PageRank
Broderick Crawford144673.74
Carlos Castro225529.05
Eric Monfroy357963.05