Selection

Basic selection (s0)

1. 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.
2. Compute the volume $V_S$ of the simplex defined by these points.
3. Select the three first ones.
4. 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}$.