Dynamic Grouping Crowding Differential Evolution with Ensemble of Parameters for Multi-modal Optimization

In recent years, multi-modal optimization has become an important area of active research. Many algorithms have been developed in literature to tackle multi-modal optimization problems. In this work, a dynamic grouping crowding differential evolution (DGCDE) with ensemble of parameter is proposed. In this algorithm, the population is dynamically regrouped into 3 equal subpopulations every few generations. Each of the subpopulations is assigned a set of parameters. The algorithms is tested on 12 classical benchmark multi-modal optimization problems and compared with the crowding differential evolution (Crowding DE) in literature. As shown in the experimental results, the proposed algorithm outperforms the Crowding DE with all three different parameter settings on the benchmark problems.

[1]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[2]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[3]  P. N. Suganthan,et al.  Ensemble of niching algorithms , 2010, Inf. Sci..

[4]  Mehmet Fatih Tasgetiren,et al.  Differential evolution algorithm with ensemble of parameters and mutation strategies , 2011, Appl. Soft Comput..

[5]  P. N. Suganthan,et al.  Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.

[6]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[7]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .

[8]  P. N. Suganthan,et al.  Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization , 2009, IEEE Transactions on Evolutionary Computation.

[9]  P. John Clarkson,et al.  Erratum: A Species Conserving Genetic Algorithm for Multimodal Function Optimization , 2003, Evolutionary Computation.

[10]  D. J. Cavicchio,et al.  Adaptive search using simulated evolution , 1970 .

[11]  René Thomsen,et al.  Multimodal optimization using crowding-based differential evolution , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[12]  Ofer M. Shir,et al.  Niche Radius Adaptation in the CMA-ES Niching Algorithm , 2006, PPSN.

[13]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[14]  Georges R. Harik,et al.  Finding Multimodal Solutions Using Restricted Tournament Selection , 1995, ICGA.

[15]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[16]  K. Koper,et al.  Multimodal function optimization with a niching genetic algorithm: A seismological example , 1999, Bulletin of the Seismological Society of America.

[17]  Ponnuthurai N. Suganthan,et al.  Novel multimodal problems and differential evolution with ensemble of restricted tournament selection , 2010, IEEE Congress on Evolutionary Computation.

[18]  Edmund K. Burke,et al.  Parallel Problem Solving from Nature - PPSN IX: 9th International Conference, Reykjavik, Iceland, September 9-13, 2006, Proceedings , 2006, PPSN.

[19]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[20]  Samir W. Mahfoud.  Crowding and Preselection Revisited , 1992, PPSN.

[21]  Zachary V. Hendershot.  A Differential Evolution Algorithm for Automatically Discovering Multiple Global Optima in Multidimensional, Discontinuous Spaces , 2004, MAICS.

[22]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

[23]  David H. Ackley,et al.  An empirical study of bit vector function optimization , 1987 .