An Ant-based Solver for Subset Problems

Crawford B., Castro C., Monfroy E.

9th WSEAS International Conference on Applied Informatics and Communications, Moscow, Rusya, 20 - 22 Ağustos 2009, ss.466-468 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Moscow
  • Basıldığı Ülke: Rusya
  • Sayfa Sayıları: ss.466-468
  • İstanbul Teknik Üniversitesi Adresli: Hayır

Özet

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.