A parameterless-niching-assisted bi-objective approach to multimodal optimization

Evolutionary algorithms are becoming increasingly popular for multimodal and multi-objective optimization. Their population based nature allows them to be modified in a way so as to locate and preserve multiple optimal solutions (referred to as Pareto-optimal solutions in multi-objective optimization). These modifications are called niching methods, particularly in the context of multimodal optimization. In evolutionary multiobjective optimization, the concept of dominance and diversity preservation inherently causes niching. This paper proposes an approach to multimodal optimization which combines this power of dominance with traditional variable-space niching. The approach is implemented within the NSGA-II framework and its performance is studied on 20 benchmark problems. The simplicity of the approach and the absence of any special niching parameters are the hallmarks of this study.

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

[2]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

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

[4]  Kalyanmoy Deb,et al.  Multimodal Optimization Using a Bi-Objective Evolutionary Algorithm , 2012, Evolutionary Computation.

[5]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[6]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[7]  Samir W. Mahfoud A Comparison of Parallel and Sequential Niching Methods , 1995, ICGA.

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

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

[10]  R. K. Ursem Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[11]  Charu C. Aggarwal,et al.  On the Surprising Behavior of Distance Metrics in High Dimensional Spaces , 2001, ICDT.

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

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

[14]  P. John Clarkson,et al.  A Species Conserving Genetic Algorithm for Multimodal Function Optimization , 2002, Evolutionary Computation.

[15]  Yu Liu,et al.  A Survey on Particle Swarm Optimization Algorithms for Multimodal Function Optimization , 2011, J. Softw..

[16]  Richard A. Watson,et al.  Reducing Local Optima in Single-Objective Problems by Multi-objectivization , 2001, EMO.

[17]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[18]  Xiaodong Yin,et al.  A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization , 1993 .

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

[20]  Aravind Srinivasan,et al.  Innovization: innovating design principles through optimization , 2006, GECCO.

[21]  David E. Goldberg,et al.  Probabilistic Crowding: Deterministic Crowding with Probabilistic Replacement , 1999 .