
92 Cockroach Swarm Optimization
75 }
76 // u pdate Pg
77 i f ( v [ i ]<vPg ) { Best = i ;
78 fo r ( in t j =0; j<D; j ++) Pg [ j ]=X[ Best ] [ j ] ;
79 vPg=v [ Best ] ;
80 }
81 // d i s p e r s i o n
82 fo r ( i =0; i <N; i ++){
83 f o r ( j =0; j<D; j ++){
84 X[ i ] [ j ]=X[ i ] [ j ]+ rand ( ) ;
85 i f (X[ i ] [ j ]<Xmin [ j ] ) X[ i ] [ j ]=Xmin [ j ] ;
86 i f (X[ i ] [ j ]>Xmax[ j ] ) X[ i ] [ j ]=Xmax[ j ] ;
87 }
88 v [ i ]=OF(X [ i ] ,D) ;
89 i f ( v [ i ]<vPg ) { Best = i ;
90 f o r ( i n t j =0; j<D; j ++) Pg [ j ]=X[ Best ] [ j ] ;
91 vPg=v [ Best ] ;
92 }
93 }
94 // r u t h l e s s be h a v i o r
95 in t RANDOM = rand ( ) %N;
96 fo r ( j =0; j <D; j ++ ...