Foundations of Genetic Algorithms, Volume 2 provides insight of theoretical work in genetic algorithms. This book provides a general understanding of a canonical genetic algorithm.
Organized into six parts encompassing 19 chapters, this volume begins with an overview of genetic algorithms in the broader adaptive systems context. This text then reviews some results in mathematical genetics that use probability distributions to characterize the effects of recombination on multiple loci in the absence of selection. Other chapters examine the static building block hypothesis (SBBH), which is the underlying assumption used to define deception. This book discusses as well the effect of noise on the quality of convergence of genetic algorithms. The final chapter deals with the primary goal in machine learning and artificial intelligence, which is to dynamically and automatically decompose problems into simpler problems to facilitate their solution.
This book is a valuable resource for theorists and genetic algorithm researchers.