Difference between revisions of "Selection"

Revision as of 17:37, 28 June 2013

TO COMPLETE

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}$;

@@ Line 2: / Line 2: @@
 == Basic selection (s0) ==
-Select a few agents (positions), typically three<br />
+# 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}.
-Sort them.
+If  $x_{best}$  is better than the best ever found (i.e.  $Best$ ), set  $Best=x_{best}$ ;