Foundations of Genetic Algorithms 1991 (FOGA 1) discusses the theoretical foundations of genetic algorithms (GA) and classifier systems. This book compiles research papers on selection and convergence, coding and representation, problem hardness, decept
Foundations of Genetic Algorithms 1991 (FOGA 1) discusses the theoretical foundations of genetic algorithms (GA) and classifier systems. This book compiles research papers on selection and convergence, coding and representation, problem hardness, deception, classifier system design, variation and recombination, parallelization, and population divergence. Other topics include the non-uniform Walsh-schema transform; spurious correlations and premature convergence in genetic algorithms; and variable default hierarchy separation in a classifier system. The grammar-based genetic algorithm; conditions for implicit parallelism; and analysis of multi-point crossover are also elaborated. This text likewise covers the genetic algorithms for real parameter optimization and isomorphisms of genetic algorithms. This publication is a good reference for students and researchers interested in genetic algorithms.
Our site uses cookies and similar technologies to offer you a better experience. We use analytical cookies (our own and third party) to understand and improve your browsing experience, and advertising cookies (our own and third party) to send you advertisements in line with your preferences. To modify or opt-out of the use of some or all of our cookies, please go to “Manage Cookies” or view our Cookie Policy to find out more. By clicking “Accept all” you consent to the use of these cookies.