A parallel compact Differential Evolution (pcDE) algorithm is proposed in this paper. The population is separated into multiple groups and the individual is run by using the method of compact Differential Evolution. The communication is implemented after predefined iterations. Two communication strategies are proposed in this paper. The first one is to replace the local optimal solution by global optimal solution in all groups, which is called optimal elite strategy (oe); the second one is to replace the local optimal solution by mean value of the local optimal solution in all groups, which is called mean elite strategy (me). Considering that the pcDE algorithm does not need to store a large number of solutions, the algorithm can adapt to the environment with weak computing power. In order to prove the feasibility of pcDE, several groups of comparative experiments are carried out. Simulation results based on the 25 test functions demonstrate the efficacy of the proposed two communication strategies for the pcDE. Finally, the proposed pcDE is applied to image segmentation and experimental results also demonstrate the superior quality of the pcDE compared with some existing methods.
|Number of pages||22|
|Journal||Applied Sciences (Switzerland)|
|Publication status||Published - 24 Mar 2020|
Bibliographical notec 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
- Communication strategies
- Compact differential evolution (cde)
- Image segmentation
- Parallel compact differential evolution (pcde)