Swarm Intelligence Algorithms

Step-by-step numerical example of DVBA 129

49 // a s s i g n t h e b e s t ba t to xg b e s t

50 f o r ( i n t i =0; i <D; i ++) x gb e st [ i ]=x [ t he B es t ] [ i ] ;

51 // main program lo op :

52 while ( a ss es sme nt <maxAssessment ) {

53 // f o r each b at

54 f o r ( i nt i =0; i <P; i ++){

55 as s e s s m en t = a s s e ss m en t + ( k∗ j ) ;

56 in t n=0, th eHbe st =0;

57 // ge ne r at e th e se ar c h sc ope matr i x f o r t he b a t :

58 fo r ( i n t z =0; z<j ; z++){ // wave v e c t o r s

59 for ( int m=0; m<k ; m++){ // s ea rc h p o i n t s

60 f o r ( i nt s =0; s<D; s++){ // f o r each dimension

61 u [ z ] [ s]=−1+2∗ r ( ) ;

62 A[ z ] [