Difference between revisions of "Natural selection in search and computation"
From Encyclopedia of Mathematics
(Importing text file) |
m (AUTOMATIC EDIT (latexlist): Replaced 2 formulas out of 2 by TEX code with an average confidence of 2.0 and a minimal confidence of 2.0.) |
||
| Line 1: | Line 1: | ||
| + | <!--This article has been texified automatically. Since there was no Nroff source code for this article, | ||
| + | the semi-automatic procedure described at https://encyclopediaofmath.org/wiki/User:Maximilian_Janisch/latexlist | ||
| + | was used. | ||
| + | If the TeX and formula formatting is correct, please remove this message and the {{TEX|semi-auto}} category. | ||
| + | |||
| + | Out of 2 formulas, 2 were replaced by TEX code.--> | ||
| + | |||
| + | {{TEX|semi-auto}}{{TEX|done}} | ||
''evolutionary computation'' | ''evolutionary computation'' | ||
| Line 4: | Line 12: | ||
====References==== | ====References==== | ||
| − | <table>< | + | <table><tr><td valign="top">[a1]</td> <td valign="top"> N.K. Bansal, S. Gupta, "On the natural selection rule in general linear models" ''Metrika'' , '''46''' (1997) pp. 59–69</td></tr><tr><td valign="top">[a2]</td> <td valign="top"> "Evolutionary algorithms in engineering applications" D. Dasgupta (ed.) Z. Michalewicz (ed.) , Springer (1997)</td></tr><tr><td valign="top">[a3]</td> <td valign="top"> D.E. Goldberg, "Genetic algorithms in search, optimization and machine learning" , Addison-Wesley (1989)</td></tr><tr><td valign="top">[a4]</td> <td valign="top"> J.R. Koza, "Genetic programming: on the programming of computers by means of natural selection and genetics" , MIT (1992)</td></tr><tr><td valign="top">[a5]</td> <td valign="top"> Z. Michalewicz, "Genetic algorithms $+$ data structures $=$ evolution programs" , Springer (1992)</td></tr><tr><td valign="top">[a6]</td> <td valign="top"> L.C. Tang, "A nonparametric approach for selecting the most reliable population" ''Queueing Systems'' , '''24''' (1996) pp. 169–176</td></tr></table> |
Latest revision as of 16:58, 1 July 2020
evolutionary computation
An evolutionary algorithm is a general-purpose search procedure based on the mechanisms of natural selection and population genetics. Different variants are: genetic algorithms (cf. Genetic algorithm); evolutionary strategies; evolutionary programming; genetic programming. Such algorithms and ideas have found many applications in, e.g.: scheduling theory; circuit and network design; architectural design; control (cf. Control system); signal processing; selection of most reliable populations (in statistics); optimal treatment (in statistics); production planning; etc.
References
| [a1] | N.K. Bansal, S. Gupta, "On the natural selection rule in general linear models" Metrika , 46 (1997) pp. 59–69 |
| [a2] | "Evolutionary algorithms in engineering applications" D. Dasgupta (ed.) Z. Michalewicz (ed.) , Springer (1997) |
| [a3] | D.E. Goldberg, "Genetic algorithms in search, optimization and machine learning" , Addison-Wesley (1989) |
| [a4] | J.R. Koza, "Genetic programming: on the programming of computers by means of natural selection and genetics" , MIT (1992) |
| [a5] | Z. Michalewicz, "Genetic algorithms $+$ data structures $=$ evolution programs" , Springer (1992) |
| [a6] | L.C. Tang, "A nonparametric approach for selecting the most reliable population" Queueing Systems , 24 (1996) pp. 169–176 |
How to Cite This Entry:
Natural selection in search and computation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Natural_selection_in_search_and_computation&oldid=17229
Natural selection in search and computation. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Natural_selection_in_search_and_computation&oldid=17229
This article was adapted from an original article by M. Hazewinkel (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article