Abstract
Conference Title: 2017 26th Wireless and Optical Communication Conference (WOCC) Conference Start Date: 2017, April 7 Conference End Date: 2017, April 8 Conference Location: Newark, NJ, USA A differential evolution (DE) algorithm is an evolutionary algorithm for optimization problems over a continuous domain. To solve high dimensional global optimization problems, this work investigates the performance of differential evolution algorithms under a multi-population strategy. The original DE algorithm generates an initial set of suitable solutions. The multi population strategy divides the set into several subsets. These subsets evolve independently and connect with each other according to the DE algorithm. This helps in preserving the diversity of the initial set. Furthermore, a comparison of combination of different mutation techniques on several optimization algorithms is studied to verify their performance. Finally the computational results on eleven well-know benchmark optimization functions, reveal some interesting relationship between the number of subpopulations and performance of the DE.