Analysis of Selection, Mutation and Recombination in Genetic Algorithms

@inproceedings{Mhlenbein1995AnalysisOS,
  title={Analysis of Selection, Mutation and Recombination in Genetic Algorithms},
  author={Heinz M{\"u}hlenbein and Dirk Schlierkamp-Voosen},
  booktitle={Evolution and Biocomputation},
  year={1995}
}
Genetic algorithms have been applied fairly successful to a number of optimization problems. Nevertheless, a common theory why and when they work is still missing. In this paper a theory is outlined which is based on the science of plant and animal breeding. A central part of the theory is the response to selection equation and the concept of heritability. A fundamental theorem states that the heritability is equal to the regression coefficient of parent to offspring. The theory is applied to… 
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
TLDR
It is shown how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA and it is shown that recombination and mutation are complementary search operators.
An Individually Variable Mutation-Rate Strategy for Genetic Algorithms
TLDR
A mutation-rate strategy that is variable between individuals within a given generation based on the individual's relative performance for the purpose of function optimization is proposed.
On the practical usage of genetic algorithms in ecology and evolution
TLDR
While genetic algorithms offer great power and flexibility by drawing inspiration from evolutionary processes, they are (usually) not a faithful model of genetics or evolution.
1 Statistical Inference as a Theoretical Foundation of Genetic Algorithms
  • Computer Science
TLDR
The aim of the theory is to identify measures which allow to control the BGA search most effectively, which should lead to a scientific foundation of one of the key technologies in real world computing-problem solving by simulating evolution.
On the practical usage of genetic algorithms in ecology and evolution
TLDR
This article aims to demystify genetic algorithms and provide assistance to researchers; basic programming knowledge is important for working with genetic algorithms, but none is required to read this article.
On mutation and crossover in the theory of evolutionary algorithms
TLDR
This dissertation describes a series of theoretical and experimental studies on a variety of evolutionary algorithms and models of those algorithms to explore the effects of parameterized mutation and crossover.
Recent developments in evolutionary and genetic algorithms: theory and applications
TLDR
While the paper covers many works on the theory and application of genetic algorithms, not much details are reported on genetic programming, parallel Genetic algorithms, in addition to more advanced techniques e.g. micro-genetic algorithms and multiobjective optimisation.
Adapting Operator Settings in Genetic Algorithms
TLDR
The results obtained indicate that the applicability of operator adaptation is dependent upon three basic assumptions being satisfied by the problem being tackled, including the ability of the operators to produce children of increased fitness.
Sexual Selection for Genetic Algorithms
TLDR
A new selection scheme inspired by sexual selection principles through female choice selection is proposed, and the performance of this new schemewith commonly used selection methods in solvingsome well-known problems including the Royal Road problem, the Open Shop Scheduling Problem and the Job Shop Scheduled Problem are compared.
Empirical Modelling of Genetic Algorithms
TLDR
This paper addresses the problem of reliably setting genetic algorithm parameters for consistent labelling problems by proposing a robust empirical framework, based on the analysis of factorial experiments, which are shown to be robust under extrapolation to up to triple the problem size.
...
...

References

SHOWING 1-10 OF 44 REFERENCES
The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)
TLDR
It is shown how the response to selection equation and the concept of heritability can be applied to predict the behavior of the BGA and it is shown that recombination and mutation are complementary search operators.
Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization
TLDR
The numerical performance of the BGA is demonstrated on a test suite of multimodal functions and the number of function evaluations needed to locate the optimum scales only as n ln(n) where n is thenumber of parameters.
A Survey of Evolution Strategies
TLDR
Evolution Strategies are algorithms which imitate the principles of natural evolution as a method to solve parameter optimization problems and adaptation of the strategy parameters for the mutation variances as well as their covariances are described.
Genetic Algorithms, Noise, and the Sizing of Populations
TLDR
Results suggest how the sizing equation may be viewed as a coarse delineation of a boundary between what a physicist might call two distinct phases of GA behavior, and how these results may one day lead to rigorous proofs of convergence for recombinative G As operating on problems of bounded description.
Messy Genetic Algorithms Revisited: Studies in Mixed Size and Scale
TLDR
Although additional basic work is both needed and recommended, the compelling convergence and efficiency demonstrated by mGAs recommends them for immediate application in some of the many tough, blind combinatorial optimization problems of science and engineering that have gone unsolved for want of more tractable solution techniques.
Evolution algorithms in combinatorial optimization
Genetic Algorithms in Search Optimization and Machine Learning
TLDR
This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
Evolution in Time and Space -the Parallel Genetic Algorithm
TLDR
The parallel genetic algorithm (PGA) uses two major modiications compared to the genetic algorithm, which is totally asynchronous, running with maximal eeciency on MIMD parallel computers and the traveling salesman problem.
An Overview of Evolutionary Algorithms for Parameter Optimization
Three main streams of evolutionary algorithms (EAs), probabilistic optimization algorithms based on the model of natural evolution, are compared in this article: evolution strategies (ESs),
Optimal Mutation Rates in Genetic Search
TLDR
The results indicate that a variation of the mutation rate is useful in cases where the tness function is a multimodal pseudo boolean function where multimodality may be caused by the objective function as well as the encoding mechanism.
...
...