Initialisation

From Adaptive Population based Simplex
Revision as of 17:57, 28 June 2013 by Editor (Talk | contribs)

Jump to: navigation, search

Basic initialisation (i0)

Population size vs Dimension

Draw at random N agents (positions) in the search space, according to an uniform distribution.

N=max

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.

We will need the volume V(0) of the previous simplex. As no one has been defined yet, we simply set it to 0:
V(0)=0