4.5 Article

Improving Performance of Differential Evolution Using Multi-Population Ensemble Concept

Journal

SYMMETRY-BASEL
Volume 15, Issue 10, Pages -

Publisher

MDPI
DOI: 10.3390/sym15101818

Keywords

differential evolution; optimization; population diversity; heterogeneous distributed differential evolution

Ask authors/readers for more resources

Differential evolution (DE) is a simple yet powerful evolutionary algorithm used for real-world problem solving. This research proposes a solution that utilizes sub-populations to promote population diversity and improve algorithm performance. Experimental outcomes demonstrate the superiority of the proposed method over existing algorithms.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available