A Novel Global ABC Algorithm with Self-Perturbing

Journal of Intelligent Systems 26 (4) (2017)
  Copy   BIBTEX

Abstract

Artificial bee colony is a kind of a metaheuristic population-based algorithms proposed in 2005. Due to its simple parameters and flexibility, the ABC algorithm is applied to engineering problems, algebra problems, and so on. However, its premature convergence and slow convergence speed are inherent shortcomings. Aiming at the shortcomings, a novel global ABC algorithm with self-perturbing is proposed in this paper. On the basis of the original search equation, IGABC adopts a novel self-adaptive search equation, introducing the guidance of the global optimal solution. The search method improves the convergence precision and the global search capacity. An excellent leader can lead the whole team to obtain more success. In order to obtain a better “leader,” IGABC proposes a novel method with global self-perturbing. To avoid falling into the local optimum, this paper designed a new mutation strategy that simulates the natural phenomenon of sick fish being eaten.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2017-12-14

Downloads
2 (#1,824,960)

6 months
2 (#1,448,741)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references