Selection - Revision history

Editor: /* Adaptive probability */

2013-06-28T16:15:14Z

‎Adaptive probability

2013-06-28T16:12:39Z

2013-06-28T15:50:37Z

2013-06-28T15:47:35Z

2013-06-28T15:38:56Z

‎Basic selection (s0)

2013-06-28T15:37:50Z

‎Basic selection (s0)

2013-06-12T19:49:01Z

2013-06-11T09:15:14Z

2013-06-11T09:14:30Z

Created page with "TO COMPLETE Select a few agents (positions), typically three Sort them."

New page

TO COMPLETE

Select a few agents (positions), typically three
Sort them.

@@ Line 7: / Line 7: @@
 === Adaptive probability ===
 Compute the volume $V(1)$ of the simplex. If the previous volume is zero (in practice, too small) the probability $p$ is set to 0.5. If not, the formula is
 $$
@@ Line 12: / Line 15: @@
 $$
-The rationale is the following:<br />
+After that, we simply set $V(0)=V(1)$, to save the simplex volume as the "previous" one.
-the more the simplex volume increases, the less the algorithm is successful, and the more one needs randomness to increase the diversity.

@@ Line 1: / Line 1: @@
 == 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.
 # 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 1: / Line 1: @@
 == Basic selection (s0) ==
-# select a simplex S (i.e. $D+1$ individuals) at random;
+# 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.
-# select the three first ones;
+# Compute the volume $V_S$ of the simplex defined by these points.
-# sort them, by increasing order of value (fitness). They are $x_{best}$, $x_{worst2}$, and $w_{worst}$.
+# Select the three first ones.
 If $x_{best}$ is better than the best ever found (i.e. $Best$), set $Best=x_{best}$.

← Older revision		Revision as of 15:47, 28 June 2013
Line 1:		Line 1:
−	~~TO COMPLETE~~
−
	== Basic selection (s0) ==		== Basic selection (s0) ==
	# select a simplex S (i.e. $D+1$ individuals) at random;		# select a simplex S (i.e. $D+1$ individuals) at random;

@@ Line 4: / Line 4: @@
 # 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, 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}$.

@@ Line 1: / Line 1: @@
 TO COMPLETE
 Select a few agents (positions), typically three<br />
 Sort them.