Ant colony optimization for finding the global minimum

Toksari M. D.

APPLIED MATHEMATICS AND COMPUTATION, cilt.176, sa.1, ss.308-316, 2006 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 176 Sayı: 1
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.amc.2005.09.043
  • Dergi Adı: APPLIED MATHEMATICS AND COMPUTATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.308-316
  • Erciyes Üniversitesi Adresli: Hayır

Özet

The ant colony optimization (ACO) algorithms are multi-agent systems in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem. This paper presents the ACO based algorithm to find global minimum. Algorithm is based on that each ant searches only around the best solution of the previous iteration. This algorithm was experimented on test problems, and successful results were obtained. The algorithm was compared with other methods which had been experimented on the same test problems, and observed to be better. (c) 2005 Elsevier Inc. All rights reserved.