DocumentCode
3029946
Title
An Ant-Based Solver for Subset Problems
Author
Crawford, Broderick ; Castro, Carlos ; Monfroy, Eric
fYear
2009
fDate
28-29 Dec. 2009
Firstpage
268
Lastpage
270
Abstract
Subset problems are models for many important applications in the field of operational research. In this paper, we solve some benchmarks of the set partitioning problem with an ant-based algorithm using a transition rule with a lookahead mechanism. It 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
operations research; optimisation; set theory; ant colony optimization; ant-based solver; operational research; set partitioning problem; subset problems; Ant colony optimization; Cost function; Job shop scheduling; Labeling; Partitioning algorithms; Processor scheduling; Telecommunication computing; Telecommunication control; Testing; Ant Colony Optimization; Lookahead Tecniques; Set Partitioning Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on
Conference_Location
Trivandrum, Kerala
Print_ISBN
978-1-4244-5321-4
Electronic_ISBN
978-0-7695-3915-7
Type
conf
DOI
10.1109/ACT.2009.74
Filename
5376702
Link To Document