background

Uniform crossover in genetic algorithms

Genetic Algorithms

From the Publisher:

"This is the best general book on Genetic Algorithms written to date. It covers background, history, and motivation; it selects important, informative examples of applications and discusses the use of Genetic Algorithms in scientific models; and it gives a good account of the status of the theory of Genetic Algorithms. Best of all the book presents its material in clear, straightforward, felicitous prose, accessible to anyone with a college-level scientific background. If you want a broad, solid understanding of Genetic Algorithms -- where they came from, what's being done with them, and where they are going -- this is the book.
-- John H. Holland, Professor, Computer Science and Engineering, and Professor of Psychology, The University of Michigan; External Professor, the Santa Fe Institute. 
Genetic algorithms have been used in science and engineering as adaptive algorithms for solving practical problems and as computational models of natural evolutionary systems. This brief, accessible introduction describes some of the most interesting research in the field and also enables readers to implement and experiment with genetic algorithms on their own. It focuses in depth on a small set of important and interesting topics -- particularly in machine learning, scientific modeling, and artificial life -- and reviews a broad span of research, including the work of Mitchell and her colleagues. 
The descriptions of applications and modeling projects stretch beyond the strict boundaries of computer science to include dynamical systems theory, game theory, molecular biology, ecology, evolutionary biology, and population genetics, underscoring the exciting "general purpose" nature of genetic algorithms as search methods that can be employed across disciplines. 
An Introduction to Genetic Algorithms is accessible to students and researchers in any scientific discipline. It includes many thought and computer exercises that build on and reinforce the reader's understanding of the text. 
The first chapter introduces genetic algorithms and their terminology and describes two provocative applications in detail. The second and third chapters look at the use of genetic algorithms in machine learning (computer programs, data analysis and prediction, neural networks) and in scientific models (interactions among learning, evolution, and culture; sexual selection; ecosystems; evolutionary activity). Several approaches to the theory of genetic algorithms are discussed in depth in the fourth chapter. The fifth chapter takes up implementation, and the last chapter poses some currently unanswered questions and surveys prospects for the future of evolutionary computation.

background or methods

/pdf/an-introduction-to-genetic-algorithms-32faq13a56.pdf

An Introduction to Genetic Algorithms

Introduction to Optimization The Binary Genetic Algorithm The Continuous Parameter Genetic Algorithm Applications An Added Level of Sophistication Advanced Applications Evolutionary Trends Appendix Glossary Index.

https://cdn.preterhuman.net/texts/science_and_technology/nature_and_biology/Bioinformatics/Practical%20Genetic%20Algorithms%20-%20Randy%20L.%20Haupt,%20Sue%20Ellen%20Haupt.pdf

Practical Genetic Algorithms

This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithm.

https://sci2s.ugr.es/sites/default/files/files/linksInterest/Tutorials/Whitley94.pdf

A genetic algorithm tutorial

This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or “steady state”) selection are compared on the basis of solutions to deterministic difference or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed analytical investigation of selection techniques.

/pdf/a-comparative-analysis-of-selection-schemes-used-in-genetic-3w3vzcmzm0.pdf

Uniform crossover in genetic algorithms

Citations

Genetic Algorithms

An Introduction to Genetic Algorithms

Practical Genetic Algorithms

A genetic algorithm tutorial

A Comparative Analysis of Selection Schemes Used in Genetic Algorithms

Related Papers (5)

Adaptation in natural and artificial systems

Genetic algorithms in search, optimization and machine learning

Genetic Algorithms + Data Structures = Evolution Programs

Genetic Algorithms in Search

Genetic Algorithms