Artificial Bee Colony Algorithm Based on Dimensional Memory Mechanism and Adaptive Elite Population for Training Artificial Neural Networks

Abstract

Based on dimensional memory mechanism and adaptive elite population, this paper proposes a satisfactory and efficient artificial bee colony algorithm (DMABC_elite) to solve optimization problems and train artificial neural networks (ANN). DMABC_elite proposes the concept of adaptive elite population that changes dynamically with the search process, and modifies the search equations for employed and onlooker bee phases on this basis. In addition, a dimensional memory mechanism has been introduced that allows multi-dimensional updates, which improves exploitation and speeds up convergence. Next, a new selection strategy and a Lévy flight-based solution-generating method are introduced in the scout bee phase to enhance the global search ability. Finally, the performance of DMABC_elite on two different problem groups is analyzed experimentally. On the one hand, DMABC_elite is evaluated using 22 classical benchmark functions with different dimensions and CEC 2013 test functions. Compared with basic ABC and nine state-of-the-art ABC variants, DMABC_elite achieved better results, ranking first in all 10-, 30- and 100-dimensional tests across 22 classical benchmark functions and 30-dimensional tests across CEC 2013 test functions. On the other hand, DMABC_elite is compared with traditional backpropagation-based algorithms and other ABC variants when training seven different ANNs. The results show that DMABC_elite is efficient and competitive in training ANNs.

Keywords

• Artificial bee colony algorithm
• adaptive elite population
• dimensional memory mechanism
• search equation
• artificial neural network