Skip to main content

Save up to 30% on Elsevier print and eBooks with free shipping. No promo code needed.

Save up to 30% on print and eBooks.

Foundations of Genetic Algorithms 1995 (FOGA 3)

  • 1st Edition, Volume 3 - March 7, 1994
  • Editor: FOGA
  • Language: English
  • eBook ISBN:
    9 7 8 - 1 - 4 8 3 2 - 9 5 0 2 - 2

Foundations of Genetic Algorithms, 3 focuses on the principles, methodologies, and approaches involved in the integration of genetic algorithm into mainstream mathematics, as well… Read more

Foundations of Genetic Algorithms 1995 (FOGA 3)

Purchase options

LIMITED OFFER

Save 50% on book bundles

Immediately download your ebook while waiting for your print delivery. No promo code is needed.

Institutional subscription on ScienceDirect

Request a sales quote
Foundations of Genetic Algorithms, 3 focuses on the principles, methodologies, and approaches involved in the integration of genetic algorithm into mainstream mathematics, as well as genetic operators, genetic programming, and evolutionary algorithms. The selection first offers information on an experimental design perspective on genetic algorithms; schema theorem and price's theorem; and fitness variance of formae and performance prediction. Discussions focus on representation-independent recombination, representation-independent mutation and hill-climbing, recombination and the re-emergence of schemata, and Walsh transforms and deception. The publication then examines the troubling aspects of a building block hypothesis for genetic programming and order statistics for convergence velocity analysis of simplified evolutionary algorithms. The manuscript ponders on stability of vertex fixed points and applications; predictive models using fitness distributions of genetic operators; and modeling simple genetic algorithms for permutation problems. Topics include exact models for permutations, fitness distributions of genetic operators, predictive model based on linear fitness distributions, and stability in the simplex. The book also takes a look at the role of development in genetic algorithms and productive recombination and propagating and preserving schemata. The selection is a dependable source of data for mathematicians and researchers interested in genetic algorithms.