Comparison of Different Ant Colony Optimization Algorithm Approaches in Asymmetric Assignment Problems

Sel C., YILMAZ A. E., EFE M., Yaylagul T., Emel S. U.

9th International Conference on Electronics Computer and Computation (ICECCO 2012), Ankara, Türkiye, 1 - 03 Kasım 2012, ss.150-153 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Ankara
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.150-153
  • Anahtar Kelimeler: Ant Colony Optimization, Assignment Problems
  • Ankara Üniversitesi Adresli: Evet

Özet

Assignment problems arise in different situations where one tries to find an optimal way to assign n tasks to in assets. In this paper we investigate the performance of four different Ant Colony Optimization (ACO) approaches in asymmetric assignment problems. Algorithms which use the local cost in calculations produce better solutions as these algorithms only consider the cost of the task(i) assignment to the asset(j) and other assignments do not affect amount of pheromone that is laid.