Benchmark Functions for CEC'2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization'

Evolutionary Algorithms (EAs) in their original forms are usually designed for locating a single global solution. These algorithms typically converge to a single solution because of the global selection scheme used. Nevertheless, many realworld problems are “multimodal” by nature, i.e., multiple satisfactory solutions exist. It may be desirable to locate many such satisfactory solutions so that a decision maker can choose one that is most proper in his/her problem domain. Numerous techniques have been developed in the past for locating multiple optima (global or local). These techniques are commonly referred to as “niching” methods. A niching method can be incorporated into a standard EA to promote and maintain formation of multiple stable subpopulations within a single population, with an aim to locate multiple globally optimal or suboptimal solutions. Many niching methods have been developed in the past, including crowding [1], fitness sharing [2], deterministic crowding [3], derating [4], restricted tournament selection [5], parallelization [6], stretching and deflation [7], clustering [8], clearing [9], and speciation [10], etc. Although these niching methods have been around for many years, further advances in this area have been hindered by several obstacles: most studies focus on very low dimensional multimodal problems (2 or 3 dimensions), therefore it is difficult to assess these methods’ scalability to high dimensions; some niching methods introduces new parameters which are difficult to set, making these methods difficult to use; different benchmark test functions or different variants of the same functions are used, hence comparing the performance of different niching methods is difficult. We believe it is now time to adopt a unifying framework for evaluating niching methods, so that further advance in this area can be made with ease. In this technical report, we put together 20 benchmark test functions (including several identical functions with different dimension sizes), with different characteristics, for evaluating niching algorithms. The first 10 benchmark functions are simple, well known and widely used functions, largely based on some recent studies on niching [11], [12], [13]. The remaining benchmark functions

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

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

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

[4]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[5]  Ralph R. Martin,et al.  A Sequential Niche Technique for Multimodal Function Optimization , 1993, Evolutionary Computation.

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

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

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

[9]  Patrick Siarry,et al.  Island Model Cooperating with Speciation for Multimodal Optimization , 2000, PPSN.

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

[11]  Michael N. Vrahatis,et al.  On the computation of all global minimizers through particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

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

[13]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

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

[15]  Xiaodong Li,et al.  This article has been accepted for inclusion in a future issue. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 1 Locating and Tracking Multiple Dynamic Optima by a Particle Swarm Model Using Speciation , 2022 .

[16]  Xiaodong Li,et al.  Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology , 2010, IEEE Transactions on Evolutionary Computation.

[17]  Kalyanmoy Deb,et al.  A Bi-criterion Approach to Multimodal Optimization: Self-adaptive Approach , 2010, SEAL.

[18]  Kalyanmoy Deb,et al.  Finding multiple solutions for multimodal optimization problems using a multi-objective evolutionary approach , 2010, GECCO '10.

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

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