Difference between revisions of "Initialisation"
From Adaptive Population based Simplex
m (→Basic APS) |
m (→Basic initialisation (i0)) |
||
| Line 1: | Line 1: | ||
== Basic initialisation (i0) == | == Basic initialisation (i0) == | ||
| − | + | [[Image:Basic APS N vs D.png|right|thumb|400px|Population size vs Dimension]] | |
Draw at random $N$ agents (positions) in the search space, according to an uniform distribution. | Draw at random $N$ agents (positions) in the search space, according to an uniform distribution. | ||
| Line 7: | Line 7: | ||
where $D$ is the dimension of the search space. Note that $N$ needs to be at least equal to $D+1$. | where $D$ is the dimension of the search space. Note that $N$ needs to be at least equal to $D+1$. | ||
| − | + | Evaluate the $N$ individuals. Save the best one as $Best$. | |
Revision as of 17:46, 28 June 2013
Basic initialisation (i0)
Draw at random $N$ agents (positions) in the search space, according to an uniform distribution.
$N=\max\left(40+2\sqrt{D},\sqrt{40^{2}+\left(D+2\right)^{2}}\right)\tag{1}$
where $D$ is the dimension of the search space. Note that $N$ needs to be at least equal to $D+1$.
Evaluate the $N$ individuals. Save the best one as $Best$.
