"
Team:Groningen/modeling genetic algorithms
From 2011.igem.org
(Difference between revisions)
(Created page with "{{HeaderGroningen2011}} =Genetic algorithms= ==Convergence== {{FooterGroningen2011}}") |
|||
| Line 1: | Line 1: | ||
{{HeaderGroningen2011}} | {{HeaderGroningen2011}} | ||
=Genetic algorithms= | =Genetic algorithms= | ||
| - | + | Genetic algorithms, (also reffered to as dynamic programming or | |
==Convergence== | ==Convergence== | ||
| + | |||
| + | |||
| + | ==How genetic algorithms work== | ||
| + | A genetic alogoritm mimics the process op population genetics in order to optimise | ||
| + | |||
| + | |||
| + | It repeats teh following step a number of times (either a fixed number of times, or contrained by some metrix such as the fitness or the change thereof.) | ||
| + | |||
| + | |||
| + | ===Mutation=== | ||
| + | * crossing over | ||
| + | ===Evaluation=== | ||
| + | ===Selection=== | ||
| + | |||
| + | |||
{{FooterGroningen2011}} | {{FooterGroningen2011}} | ||
Revision as of 08:58, 31 August 2011
Genetic algorithms
Genetic algorithms, (also reffered to as dynamic programming or
Convergence
How genetic algorithms work
A genetic alogoritm mimics the process op population genetics in order to optimise
It repeats teh following step a number of times (either a fixed number of times, or contrained by some metrix such as the fitness or the change thereof.)
Mutation
- crossing over
Evaluation
Selection
