A heuristic approach to find the global optimum of function

Toksari M. D.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, cilt.209, sa.2, ss.160-166, 2007 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 209 Sayı: 2
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1016/j.cam.2006.10.074
  • Dergi Adı: JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.160-166
  • Anahtar Kelimeler: global optimum, ant colony optimization, metaheuristics, ANT COLONY OPTIMIZATION, ALGORITHM, MINIMUM
  • Erciyes Üniversitesi Adresli: Hayır

Özet

This paper presents the modified ant colony optimization (MACO) based algorithm to find global optimum. Algorithm is based on that solution space of problem is restricted by the best solution of the previous iteration. Furthermore, the proposed algorithm is that variables of problem are optimized concurrently. This algorithm was tested on some standard test functions, and successful results were obtained. its performance was compared with the other algorithms, and observed to be better. (C) 2006 Elsevier B.V. All fights reserved.