An Ant-based Solver for Subset Problems


Crawford B., Castro C., Monfroy E.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Russia, 20 - 22 August 2009, pp.466-468 identifier

  • Publication Type: Conference Paper / Full Text
  • City: Moscow
  • Country: Russia
  • Page Numbers: pp.466-468

Abstract

Subset Problems are models for many important applications in the field of Operational Research. In this paper. we solve some benchmarks of them 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.