Swarm Intelligence Algorithms

240 Krill Herd Algorithm

150 double Cr = R_vec [ j ] [ 1 ] < C_rate ;

151 i n t NK4Cr = n e a r b y in t (KN∗ ( ( rand ( ) % 10 00 0) / 100 00) + 0 . 5 ) ;

152 X[ j ] [ i ] = X[ j ] [ NK4Cr ] ∗ (1 − Cr ) + X[ j ] [ i ] ∗ Cr ;

153 }

154 }

155 f o r ( i n t j = 0 ; j < dim ; j ++) {

156 D el ta [ j ] [ 1 ] = X[ j ] [ i ] ;

157 X[ j ] [ i ] = D el ta [ j ] [ 1 ] + DX[ j ] [ i ] ;

158 /∗ Bounds Checking ∗/

159 i f (X[ i ] [ j ] > ub [ j ] ) X[ i ] [ j ] = ub [ j ] ;

160 i f (X[ i ] [ j ] < l b [ j ] ) X[ i ] [ j ] = l b [ j ] ;

161 }

162 K[ i ] = OF(X[ i ] , dim ) ;

163 i f (K[ i ] < Kib [ i ] ) {

164 Kib [ i ] = K[ i ] ;

165 f o r ( i nt j = 0 ; j < dim ; j