更改

<strong>Genetic algorithms</strong> are based on the classic view of a chromosome as a string of genes.  R.A. Fisher used this view to found mathematical genetics, providing mathematical formula specifying the rate at which particular genes would spread through a population [[#fisher1958|(Fisher, 1958)]].  Key elements of Fisher’s formulation are:  

<strong>Genetic algorithms</strong> are based on the classic view of a chromosome as a string of genes.  R.A. Fisher used this view to found mathematical genetics, providing mathematical formula specifying the rate at which particular genes would spread through a population [[#fisher1958|(Fisher, 1958)]].  Key elements of Fisher’s formulation are:  

* a specified set of alternatives (alleles) for each gene, thereby specifying the allowable strings of genes (the possible chromosomes),

* a specified set of alternatives (alleles) for each gene, thereby specifying the allowable strings of genes (the possible chromosomes),

Natural selection, in this formulation, can be thought of as a procedure for searching through the set of possible individuals, the search space, to find individuals of progressively higher fitness.  Even when a natural population consists of a single species – say the current generation of humans – there is considerable variation within that population.  These variants constitute samples of the search space.

Natural selection, in this formulation, can be thought of as a procedure for searching through the set of possible individuals, the search space, to find individuals of progressively higher fitness.  Even when a natural population consists of a single species – say the current generation of humans – there is considerable variation within that population.  These variants constitute samples of the search space.

== Definition ==

== Definition ==