Initialisation
From Adaptive Population based Simplex
Basic initialisation (i0)
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.