Improving Performance of Differential Evolution Using Multi-Population Ensemble Concept.

Differential evolution (DE) stands out as a straightforward yet remarkably powerful evolutionary algorithm employed for real-world problem-solving purposes. In the DE algorithm, few parameters are used, and the population is evolved by applying various operations. It is difficult in evolutionary computation algorithms to maintain population diversity. The main issue is the sub-population of the DE algorithm that helps improve convergence speed and escape from the local optimum. Evolving sub-populations by maintaining diversity is an important issue in the literature that is considered in this research. A solution is proposed that uses sub-populations to promote greater diversity within the population and improve the algorithm performance. DE, heterogeneous distributed differential evolution (HDDE), multi-population ensemble differential evolution (MPEDE), and the proposed improved multi-population ensemble differential evolution (IMPEDE) are implemented using parameter settings; population sizes of 100 NP, 150 NP, and 200 NP; and dimensions of 10D, 30D, and 50D for performance comparison. Different combinations of mutations are used to generate the simulated results. The simulation results are generated using 1000, 3000, and 5000 iterations. Experimental outcomes show the superior results of the proposed IMPEDE over existing algorithms. The non-parametric significance Friedman test confirms that there is a significant difference in the performance of the proposed algorithm and other algorithms used in this study by considering a 0.05 level of significance using six benchmark functions. [ABSTRACT FROM AUTHOR]