A heuristic approach to find the global optimum of function

Toksari M. D.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, vol.209, no.2, pp.160-166, 2007 (SCI-Expanded) identifier

  • Publication Type: Article / Article
  • Volume: 209 Issue: 2
  • Publication Date: 2007
  • Doi Number: 10.1016/j.cam.2006.10.074
  • Journal Name: JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.160-166
  • Keywords: global optimum, ant colony optimization, metaheuristics, ANT COLONY OPTIMIZATION, ALGORITHM, MINIMUM
  • Erciyes University Affiliated: No

Abstract

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.