Negatively Correlated Search

Evolutionary algorithms (EAs) have been shown to be powerful tools for complex optimization problems, which are ubiquitous in both communication and big data analytics. This paper presents a new EA, namely negatively correlated search (NCS), which maintains multiple individual search processes in parallel and models the search behaviors of individual search processes as probability distributions. NCS explicitly promotes negatively correlated search behaviors by encouraging differences among the probability distributions (search behaviors). By this means, individual search processes share information and cooperate with each other to search diverse regions of a search space, which makes NCS a promising method for nonconvex optimization. The co-operation scheme of NCS could also be regarded as a novel diversity preservation scheme that, different from other existing schemes, directly promotes diversity at the level of search behaviors rather than merely trying to maintain diversity among candidate solutions. Empirical studies showed that NCS is competitive to well-established search methods in the sense that NCS achieved the best overall performance on 20 multimodal (nonconvex) continuous optimization problems. The advantages of NCS over state-of-the-art approaches are also demonstrated with a case study on the synthesis of unequally spaced linear antenna arrays.

[1]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[2]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[3]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[4]  Brice Augustin,et al.  QoE: User profile analysis for multimedia services , 2014, 2014 IEEE International Conference on Communications (ICC).

[5]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[6]  Fei Peng,et al.  Population-Based Algorithm Portfolios for Numerical Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[7]  Marjan Mernik,et al.  Exploration and exploitation in evolutionary algorithms: A survey , 2013, CSUR.

[8]  Thomas Jansen,et al.  On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms , 2002, PPSN.

[9]  Carlos García-Martínez,et al.  Global and local real-coded genetic algorithms based on parent-centric crossover operators , 2008, Eur. J. Oper. Res..

[10]  Pavel Pudil,et al.  Introduction to Statistical Pattern Recognition , 2006 .

[11]  Zhaoshui He,et al.  A modified real GA for the sparse linear array synthesis with multiple constraints , 2006 .

[12]  Xin Yao,et al.  Ensemble learning via negative correlation , 1999, Neural Networks.

[13]  Yang Yu,et al.  Pareto Ensemble Pruning , 2015, AAAI.

[14]  Nikolaus Hansen,et al.  Completely Derandomized Self-Adaptation in Evolution Strategies , 2001, Evolutionary Computation.

[15]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

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

[17]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[18]  Bernd Bischl,et al.  Tuning and evolution of support vector kernels , 2012, Evol. Intell..

[19]  Ponnuthurai N. Suganthan,et al.  Empirical study on the effect of population size on Differential evolution Algorithm , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[21]  D. Fogel.  Evolutionary algorithms in theory and practice , 1997, Complex..

[22]  Yun Shang,et al.  A Note on the Extended Rosenbrock Function , 2006 .

[23]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[24]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[25]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[26]  Xin Yao,et al.  Large scale evolutionary optimization using cooperative coevolution , 2008, Inf. Sci..

[27]  Iddo Greental,et al.  Genetic algorithms for evolving deep neural networks , 2014, GECCO.

[28]  Xin Yao,et al.  Convex Hull-Based Multiobjective Genetic Programming for Maximizing Receiver Operating Characteristic Performance , 2015, IEEE Transactions on Evolutionary Computation.

[29]  Bernhard Nebel,et al.  On the Compilability and Expressive Power of Propositional Planning Formalisms , 1998, J. Artif. Intell. Res..

[30]  Bruno Sareni,et al.  Fitness sharing and niching methods revisited , 1998, IEEE Trans. Evol. Comput..

[31]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[32]  Xin Yao,et al.  From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms , 2002, IEEE Trans. Evol. Comput..

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

[34]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[35]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[36]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..

[37]  B. P. Kumar,et al.  Design of unequally spaced arrays for performance improvement , 1999 .

[38]  Darrell Whitley,et al.  The Island Model Genetic Algorithm: On Separability, Population Size and Convergence , 2015, CIT 2015.

[39]  Z. Nie,et al.  The Application of a Modified Differential Evolution Strategy to Some Array Pattern Synthesis Problems , 2008, IEEE Transactions on Antennas and Propagation.

[40]  Mohamed-Slim Alouini,et al.  Minimizing the Symbol-Error-Rate for Amplify-and-Forward Relaying Systems Using Evolutionary Algorithms , 2015, IEEE Transactions on Communications.

[41]  A. Rydberg,et al.  Synthesis of uniform amplitude unequally spaced antenna arrays using the differential evolution algorithm , 2003 .

[42]  Quanyuan Feng,et al.  Synthesis of Unequally Spaced Antenna Arrays by Using Differential Evolution , 2010, IEEE Transactions on Antennas and Propagation.

[43]  T. Kailath.  The Divergence and Bhattacharyya Distance Measures in Signal Selection , 1967 .

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

[45]  Iain Bate,et al.  Evolutionary and Principled Search Strategies for Sensornet Protocol Optimization , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).