
Step-by-step numerical example of global version of CSO algorithm 79
89 C [ i ] [ j ] = C [ i ] [ j ] + s1 ∗ rand ( 0 , 1 ) ∗ (C [ r1 ] [ j ]
90 − C[ i ] [ j ] ) + rand (0 , 1 ) ∗ s 2 ∗ (C [ r2 ] [ j ] − C[ i ] [ j ] ) ;
91 } e l s e {
92 in t m = cH en Rel at ion [ i ] ;
93 C [ i ] [ j ] = C [ i ] [ j ] + rand (FL_MIN, FL_MAX)
94 ∗ (C[m] [ j ] − C[ i ] [ j ] ) ;
95 }
96 i f (C[ i ] [ j ] < Cmin [ j ] ) C[ i ] [ j ] = Cmin [ j ] ;
97 i f (C[ i ] [ j ] > Cmax [ j ] ) C [ i ] [ j ] = Cmax[ j ] ;
98 }
99 }
100 TheBest = 0 ;
101 f o r ( i nt i = 0 ; i < N; i ++) {
102 E [ i ] = OF(C[ i ] , D) ;
103 TheBest = (E [ i ] < E [ TheBest ] ) ? i : TheBest ;
104 }
105