L-CJADE: Differential Evolution Algorithm Based On A Linearly Decreasing Population Structure

Chaotic local search based differential evolutionary optimization algorithm (CJADE) is an improved algorithm based on JADE. It incorporates the ideas of chaotic mapping and local search to enhance the global and local search capabilities of differential evolutionary algorithms. Although the performance of this algorithm has been greatly improved compared with the original algorithm, there are still some shortcomings, such as insufficient exploitation ability, slow convergence, insufficient exploration ability, and easy to lead to local optimum. To solve these problems, we propose a linearly decreasing strategy named L-CJADE, which changes the original population structure and introduces a linearly decreasing population structure to balance the relationship between development ability and exploration ability, making the algorithm more stable and suitable for practical problems. The L-CJADE algorithm was compared with other state-of-the-art algorithms in terms of problem sets. The results show that it has better optimization ability and faster convergence speed along with relatively high stability compared to other algorithms.