JADE is a differential evolution (DE) algorithm and has been shown to be very competitive in comparison with other evolutionary optimization algorithms. However, it suffers from the premature convergence problem and is easily trapped into local optima. This article presents a novel JADE variant by incorporating chaotic local search (CLS) mechanisms into JADE to alleviate this problem. Taking advantages of the ergodicity and nonrepetitious nature of chaos, it can diversify the population and thus has a chance to explore a huge search space. Because of the inherent local exploitation ability, its embedded CLS can exploit a small region to refine solutions obtained by JADE. Hence, it can well balance the exploration and exploitation in a search process and further improve its performance. Four kinds of its CLS incorporation schemes are studied. Multiple chaotic maps are individually, randomly, parallelly, and memory-selectively incorporated into CLS. Experimental and statistical analyses are performed on a set of 53 benchmark functions and four real-world optimization problems. Results show that it has a superior performance in comparison with JADE and some other state-of-the-art optimization algorithms.

Gravitational search algorithm (GSA) inspired from physics emulates gravitational forces to guide particles’ search. It has been successfully applied to diverse optimization problems. However, its search performance is limited by its inherent mechanism where gravitational constant plays an important role in gravitational forces among particles. To improve it, this paper uses chaotic neural oscillators to adjust its gravitational constant, named GSA-CNO. Chaotic neural oscillators can generate various chaotic states according to their parameter settings. Thus, we select four kinds of chaotic neural oscillators to form distinctive chaotic characteristics. Experimental results show that chaotic neural oscillators effectively tune the gravitational constant such that GSA-CNO has good performance and stability against four GSA variants on functions. Three real-world optimization problems demonstrate the promising practicality of GSA-CNO.

Brain storm optimization (BSO) is a swarm intelligence optimization algorithm which is proven to have practical values in various fields. During these years, many modifications have been facilitated to effectively improve BSO’s search performance. So far, these modifications focus on improving the solution quality by applying different clustering methods and learning strategies, in which the population diversity is often neglected. However, in recent studies, population diversity plays a more significant role in designing optimization algorithm. A population that maintains its diversity in a high level can easily obtain better solutions than the one with low level of diversity. Therefore, this paper proposes a control method that evaluates the population diversity of BSO to improve its performance. Two diversity measures, which are known as distance-based diversity and fitness-based diversity, are implemented to realize the adaptation of algorithm parameters. The new algorithm is called multiple diversity-driven BSO (MDBSO). Its performance is verified by CEC2017 benchmark function suit and a neuron model training task. The results demonstrate the effectiveness and efficiency of MDBSO.