Global-best brain storm optimization algorithm based on chaotic difference step and opposition-based learning

Abstract

AbstractRecently, the following global-best strategy and discussion mechanism have been prevailing to solve the slow convergence and the low optimization accuracy in the brain storm optimization (BSO) algorithm. However, the traditional BSO algorithm also suffers from the problem that it is easy to fall into local optimum. Therefore, this work innovatively designed the chaotic difference step strategy. This strategy introduced four commonly used chaotic maps and difference step to expand the population search space to improve the situation. Moreover, opposition-based learning thought was innovatively adopted into the BSO algorithm. The thought aims to generate the opposition-based population, increase the search density, and make the algorithm out of the local optimum as soon as possible. In summary, this work proposed a global-best brain storm optimization algorithm based on the chaotic difference step and opposition-based learning (COGBSO). According to the CEC2013 benchmark test suit, 15 typical benchmark functions were selected, and multiple sets of simulation experiments were conducted on MATLAB. The COGBSO algorithm was also compared to recent competitive algorithms based on the complete CEC2018 benchmark test suit. The results demonstrate that the COGBSO outperforms BSO and other improved algorithms in solving complex optimization problems.