A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning

• Published in: IEEE transactions on cybernetics Vol. 43; no. 3; pp. 1011 - 1024
• Main Authors: Gao, Wei-feng, Liu, San-yang, Huang, Ling-ling
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.06.2013; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Animals; Artificial bee colony (ABC) algorithm; Artificial Intelligence; Bees - physiology; Behavior, Animal - physiology; Biomimetics - methods; Colonies; Convergence; Equations; Exploitation; Humans; Learning; Mathematical analysis; Mathematical model; Optimization; orthogonal experimental design (OED); orthogonal learning (OL); Oscillators; Pattern Recognition, Automated - methods; Sampling; search equation; Searching; Sociology; Statistics; Strategy; Studies
• ISSN: 2168-2267; 2168-2275; 2168-2275
• DOI: 10.1109/TSMCB.2012.2222373

The artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, ABC has an insufficiency regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose an improved ABC method called as CABC where a modified search equation is applied to generate a candidate solution to improve the search ability of ABC. Furthermore, we use the orthogonal experimental design (OED) to form an orthogonal learning (OL) strategy for variant ABCs to discover more useful information from the search experiences. Owing to OED's good character of sampling a small number of well representative combinations for testing, the OL strategy can construct a more promising and efficient candidate solution. In this paper, the OL strategy is applied to three versions of ABC, i.e., the standard ABC, global-best-guided ABC (GABC), and CABC, which yields OABC, OGABC, and OCABC, respectively. The experimental results on a set of 22 benchmark functions demonstrate the effectiveness and efficiency of the modified search equation and the OL strategy. The comparisons with some other ABCs and several state-of-the-art algorithms show that the proposed algorithms significantly improve the performance of ABC. Moreover, OCABC offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all the test functions.