Niching with derandomized evolution strategies in artificial and real-world landscapes

We introduce a framework of derandomized evolution strategies (ES) niching techniques. A survey of these techniques, based on 5 variants of derandomized ES, is presented, based on the fixed niche radius approach. The core mechanisms range from the very first derandomized approach to self-adaptation of ES to the sophisticated Covariance Matrix Adaptation (CMA). They are applied to artificial as well as real-world multimodal continuous landscapes, of different levels of difficulty and various dimensions, and compared with the maximum-peak-ratio (MPR) performance analysis tool. While characterizing the performance of the different derandomized variants in the context of niching, some conclusions concerning the niching formation process of the different mechanisms are drawn, and the hypothesis of a trade-off between learning time and niching acceleration is numerically confirmed. Niching with (1 + λ)-CMA core mechanism is shown to experimentally outperform all the other variants, especially on the real-world problem. Some theoretical arguments supporting the advantage of a plus-strategy for niching are discussed. For the real-world application in hand, taken from the field of Quantum Control, we show that the niching framework can overcome some degeneracy in the search space, and obtain different conceptual designs using problem-specific diversity measurements.

[1]  Thomas Weinacht,et al.  Using feedback for coherent control of quantum systems , 2002 .

[2]  Rabitz,et al.  Optimally controlled quantum molecular dynamics: A perturbation formulation and the existence of multiple solutions. , 1993, Physical review. A, Atomic, molecular, and optical physics.

[3]  Christian Igel,et al.  A computational efficient covariance matrix update and a (1+1)-CMA for evolution strategies , 2006, GECCO.

[4]  Ofer M. Shir,et al.  Dynamic niching in evolution strategies with covariance matrix adaptation , 2005, 2005 IEEE Congress on Evolutionary Computation.

[5]  M. Kimura.  The Neutral Theory of Molecular Evolution: Introduction , 1983 .

[6]  Nikolaus Hansen,et al.  A Derandomized Approach to Self-Adaptation of Evolution Strategies , 1994, Evolutionary Computation.

[7]  K. Holsinger.  The neutral theory of molecular evolution , 2004 .

[8]  Gustav Gerber,et al.  Femtosecond quantum control of molecular dynamics in the condensed phase. , 2007, Physical chemistry chemical physics : PCCP.

[9]  Ofer M. Shir,et al.  Niching in evolution strategies , 2005, GECCO '05.

[10]  Nikolaus Hansen,et al.  On the Adaptation of Arbitrary Normal Mutation Distributions in Evolution Strategies: The Generating Set Adaptation , 1995, ICGA.

[11]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

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

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

[14]  Nikolaus Hansen,et al.  Step-Size Adaption Based on Non-Local Use of Selection Information , 1994, PPSN.

[15]  Ofer M. Shir,et al.  Evolutionary Algorithms in the Optimization of Dynamic Molecular Alignment , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[16]  T. Back.  Selective pressure in evolutionary algorithms: a characterization of selection mechanisms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[17]  Ofer M. Shir,et al.  Gaining Insights into Laser Pulse Shaping by Evolution Strategies , 2007, IWINAC.

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

[19]  Herschel Rabitz,et al.  Coherent Control of Quantum Dynamics: The Dream Is Alive , 1993, Science.

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

[21]  Kompa,et al.  Whither the future of controlling quantum phenomena? , 2000, Science.

[22]  M. Preuss,et al.  On the extinction of sub-populations on multimodal landscapes , 2004 .

[23]  M. Vrakking,et al.  Revival structures in picosecond laser-induced alignment of I2 molecules. II. Numerical modeling , 2002 .

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

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

[26]  Gideon Avigad,et al.  Concept-Based Interactive Brainstorming in Engineering Design , 2004, J. Adv. Comput. Intell. Intell. Informatics.

[27]  Oliver Kramer,et al.  On three new approaches to handle constraints within evolution strategies , 2006, Natural Computing.

[28]  Stefan Roth,et al.  Covariance Matrix Adaptation for Multi-objective Optimization , 2007, Evolutionary Computation.

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

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

[31]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

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

[33]  M. Vrakking,et al.  Revival structures in picosecond laser-induced alignment of I2 molecules. I. Experimental results , 2002 .

[34]  John J. Grefenstette,et al.  Genetic algorithms and their applications , 1987 .