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. © 2009 IEEE.
|Number of pages||3|
|Publication status||Published - 1 Dec 2009|
|Event||ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies - |
Duration: 1 Dec 2009 → …
|Conference||ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies|
|Period||1/12/09 → …|