Difference between revisions of "Selection"
From Adaptive Population based Simplex
m |
m |
||
| Line 1: | Line 1: | ||
== Basic selection (s0) == | == Basic selection (s0) == | ||
| − | # | + | # Select a simplex $S$ (i.e. $D+1$ individuals) at random. Be sure that the current one is in this list. If not, replace the last of the list by the current one. |
| − | # | + | # Compute the volume $V_S$ of the simplex defined by these points. |
| − | # | + | # 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}$. | If $x_{best}$ is better than the best ever found (i.e. $Best$), set $Best=x_{best}$. | ||
Revision as of 17:50, 28 June 2013
Basic selection (s0)
- Select a simplex $S$ (i.e. $D+1$ individuals) at random. Be sure that the current one is in this list. If not, replace the last of the list by the current one.
- Compute the volume $V_S$ of the simplex defined by these points.
- 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}$.
