
50 Bat Algorithm
83 Freq [ i ]=Freq_min+(Freq_max−Freq_min ) ∗ r a ( ) ;
84 rnum=ra ( ) ;
85 f o r ( i nt j =0; j<d ; j ++)
86 {
87 v [ i ] [ j ]=v [ i ] [ j ]+( S ol [ i ] [ j ]−b e s t [ j ] ) ∗Freq [ i ] ;
88 S [ i ] [ j ]= S o l [ i ] [ j ]+v [ i ] [ j ] ;
89 i f ( rnum>r )
90 {
91 S [ i ] [ j ]= b e s t [ j ]+ 0. 1∗A∗ d i s t r i b u t i o n ( g e n e r a t o r ) ;
92 }
93 }
94 // E va lua te new s o l u t i o n s
95 Fnew=Fun ( S [ i ] , d ) ;
96 // I f t he s o l u t i o n improves or not to lo ud
97 i f ( ( Fnew<=F i t n e s s [ i ] ) && ( ra ( )>A) )
98 {
99 Fi t n e s s [ i ]=Fnew ;
100 f o r ( i nt j =0; j<d ; j ++)
101 {
102 S ol [ i ] [ j ]=S [ i