Chaotic Evolution Using Deterministic Crowding Method for Multi-modal Optimization

Xiang Meng, Yi Ding, Yan Pei

Abstract: This paper proposes a novel population-based optimization algorithm to solve the multi-modal optimization problem. We call it the chaotic evolution deterministic crowding (CEDC) algorithm. Since the genetic algorithm is difficult to find all optimal solutions and the accuracy is not high when searching for multi-modal optimization problems, we use the ergodicity of chaos to implement the exploration and fitness comparison of the deterministic crowding algorithm. Through the tests of several multi-modal benchmark functions, it is shown that the algorithm can effectively and accurately find the most optimal solutions to the multi-modal problem. It does not need to set the niche radius in advance, so it can better solve multimodal optimization problems. We test it with nine multi-modal benchmark functions ranging from one-dimension (1-D) to ten-dimension (10-D), and we compare it with a genetic algorithm and evaluate from peak ratio, max peak ratio, and running time. The experimental results show that the CEDC algorithm is better than conventional algorithms in both runtime and peak ratio.