Variable mesh optimization for the 2013 CEC Special Session Niching Methods for Multimodal Optimization

Many real-world problems have several optima, and the aim of niching optimisation algorithms is to obtain the different global optima, and not only the best solution. One common technique to create niches is the clearing method that removes solutions too close to better ones. Unfortunately, clearing is very sensitive to the niche radius, and its right value depends on the problem (in real-world problems the minimum distance between optima is unknown). In this work we propose a niching algorithm that uses clearing with an adaptive niche radius, that decreases during the run. The proposal uses an external memory that stores current global optima to avoid losing found optima during the clearing process, allowing a non-elitist search. This algorithm applies this clearing method to a mesh of solutions, expanded by the generation of nodes using combination methods between the nodes, their best neighbour, and their nearest current global optima in the population (current global optima are nodes with fitness very similar to current best fitness). The proposal is tested on the competition benchmark proposed in the Special Session Niching Methods for Multimodal Optimization, and compared with other algorithms. The proposal obtains very good results detecting global optima. In comparisons with other algorithm, this proposal obtains the best results, proving to be a very competitive niching algorithm.

[1]  Xiaodong Li,et al.  Benchmark Functions for CEC'2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization' , 2013 .

[2]  Roger J.-B. Wets,et al.  Minimization by Random Search Techniques , 1981, Math. Oper. Res..

[3]  Andries Petrus Engelbrecht,et al.  Locating multiple optima using particle swarm optimization , 2007, Appl. Math. Comput..

[4]  Magda B. Fayek,et al.  Context based clearing procedure: A niching method for genetic algorithms , 2010 .

[5]  Pablo Moscato,et al.  Memetic algorithms: a short introduction , 1999 .

[6]  Claudio De Stefano,et al.  On the role of population size and niche radius in fitness sharing , 2004, IEEE Transactions on Evolutionary Computation.

[7]  Francisco Herrera,et al.  Variable mesh optimization for continuous optimization problems , 2012, Soft Comput..

[8]  Jing J. Liang,et al.  Differential Evolution With Neighborhood Mutation for Multimodal Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[9]  Jing J. Liang,et al.  Niching particle swarm optimization with local search for multi-modal optimization , 2012, Inf. Sci..

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

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

[12]  Yao Zhao,et al.  A robust dynamic niching genetic clustering approach for image segmentation , 2011, GECCO '11.

[13]  Ponnuthurai N. Suganthan,et al.  Real-parameter evolutionary multimodal optimization - A survey of the state-of-the-art , 2011, Swarm Evol. Comput..

[14]  Grant Dick,et al.  Automatic identification of the niche radius using spatially-structured clearing methods , 2010, IEEE Congress on Evolutionary Computation.

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

[16]  Michael G. Epitropakis,et al.  Finding multiple global optima exploiting differential evolution's niching capability , 2011, 2011 IEEE Symposium on Differential Evolution (SDE).