Swarm Intelligence Algorithms

226 Hunting Search Algorithm

20 {

21 //number o f i t e r a t i o n s i s i n c r e a s i n g by one

22 i t e r=i t e r +1;

23 // moving toward th e l e a d e r .

24 HG [ i ] [ j ]= HG [ i ] [ j ]+ r ( ) ∗MML∗(HGL[ j ]−HG[ j ] ) ;

25 // p o s i t i o n c o r r e c t i o n −co o p e r a t i o n bet ween members .

26 for ( i =1, i <HGS, i ++)

27 {

28 i f ( r ( )<HGCR)

29 {

30 d=int (HGS∗rand ) ;

31 for ( j =0, j<N, j ++) ;

32 HG [ i ] [ j ]=HG[ d ] [ j ] ;

33 end

34 }

35 e l se

36 {

37 for ( j =0, j<N, j ++) ;

38 HG[ i ] [ j ]= HG[ i ] [ j ]+2∗( r ( ) −0.5) ) ∗Ramin ∗ (max(HG[ i ] )−min (HG[ i ] ) ) ∗ exp

( l o g (Ramax/Ramin ) ∗ i t e r / m axi ter ) ;

39 }

40 }