Difference between revisions of "Selection"
From Adaptive Population based Simplex
(→Basic selection (s0)) |
m (→Basic selection (s0)) |
||
Line 4: | Line 4: | ||
# select a simplex S (i.e. $D+1$ individuals) at random; | # select a simplex S (i.e. $D+1$ individuals) at random; | ||
# select the three first ones; | # select the three first ones; | ||
− | # sort them, by increasing order of value (fitness). They are $x_{best}$, $x_{worst2}$, and $w_{worst}. | + | # sort them, by increasing order of value (fitness). They are $x_{best}$, $x_{worst2}$, and $w_{worst}$. |
− | If $x_{best}$ is better than the best ever found (i.e. $Best$), set $Best=x_{best}$ | + | If $x_{best}$ is better than the best ever found (i.e. $Best$), set $Best=x_{best}$. |
Revision as of 16:38, 28 June 2013
TO COMPLETE
Basic selection (s0)
- select a simplex S (i.e. $D+1$ individuals) at random;
- select the three first ones;
- sort them, by increasing order of value (fitness). They are $x_{best}$, $x_{worst2}$, and $w_{worst}$.
If $x_{best}$ is better than the best ever found (i.e. $Best$), set $Best=x_{best}$.