Changes

It was used for the first time in 1969 as a pure optimization algorithm making the regions of acceptability smaller and smaller. Since 1970 it has been used for both ordinary optimization and manufacturing yield maximization.

It was used for the first time in 1969 as a pure optimization algorithm making the regions of acceptability smaller and smaller. Since 1970 it has been used for both ordinary optimization and manufacturing yield maximization.

In this case the rules of genetic variation such as crossover, inversion, transposition etcetera may be seen as random number generators for the phenotypes. So, in this sense GA may be seen as a genetic algorithm.

In this case the rules of genetic variation such as crossover, inversion, transposition etcetera may be seen as random number generators for the phenotypes. So, in this sense GA may be seen as a genetic algorithm.

== References ==

== References ==

* Zohar, D. The quantum self : a revolutionary view of human nature and consciousness rooted in the new physics. London, Bloomsbury, 1990

* Zohar, D. The quantum self : a revolutionary view of human nature and consciousness rooted in the new physics. London, Bloomsbury, 1990

* Åslund, N. The fundamental theorems of information theory (Swedish). Nordisk Matematisk Tidskrift, Band 9, Oslo 1961.

* Åslund, N. The fundamental theorems of information theory (Swedish). Nordisk Matematisk Tidskrift, Band 9, Oslo 1961.