Stable Mutations for Evolutionary Algorithms - Obuchowicz, Andrzej

. .

Résumé :
This book presents a set of theoretical and experimental results that describe the features of the wide family of ?-stable distributions (the normal distribution also belongs to this class) and their various applications in the mutation operator of evolutionary algorithms based on real-number representation of the individuals, and, above all, equip these algorithms with features that enrich their effectiveness in solving multi-modal, multi-dimensional global optimization problems. The overall conclusion of the research presented is that the appropriate choice of probabilistic model of the mutation operator for an optimization problem is crucial. Mutation is one of the most important operations in stochastic global optimization algorithms in the n-dimensional real space. It determines the method of search space exploration and exploitation. Most applications of these algorithms employ the normal mutation as a mutation operator. This choice is justified by the central limit theorem but is associated with a set of important limitations. Application of ?-stable distributions allows more flexible evolutionary models to be obtained than those with the normal distribution. The book presents theoretical analysis and simulation experiments, which were selected and constructed to expose the most important features of the examined mutation techniques based on ?-stable distributions. It allows readers to develop a deeper understanding of evolutionary processes with stable mutations and encourages them to apply these techniques to real-world engineering problems.

Sommaire:
Chapter 1. Introduction.- Chapter 2. Foundations of evolutionary algorithms.- Chapter 3. Stable distributions.- Chapter 4. Non-isotropic stable mutation.- Chapter 5. Isotropic stable mutation.- Chapter 6. Stable mutation with the discrete spectral measure.- Chapter 7. Isotropic mutation based on an ? -stable generator.- Chapter 8. Mutation based on directional distributions.- Chapter 9. Conclusions.- References.- Appendix A Saddle crossing problem.- Appendix B Benchmark functions.