Swarm Intelligence Algorithms

258 Monarch Butterfly Optimization

63 f l o a t pop1 [ Pn1 ] [ D] , pop2 [ Pn2 ] [ D ] ;

64 f o r ( i n t i =0; i <Pn1 ; i ++){

65 f o r ( i n t j =0; j<D; j ++){pop1 [ i ] [ j ]= s [ i ] [ j ] ; } }

66 f o r ( i n t i =0; i <Pn2 ; i ++){

67 f o r ( i n t j =0; j<D; j ++){pop2 [ i ] [ j ]= s [ Pn1+i ] [ j ] ; } }

68 //−−− m igr ati on op e r a to r

69 f o r ( i n t i =0; i <Pn1 ; i ++){

70 f o r ( i n t j =0; j<D; j ++){

71 f l o a t r=ph i ∗ r a ( ) ;

72 i f ( r<=R) { i n t r 1=rand ( )%Pn1+1;

73 Lnd1 [ i ] [ j ]= pop1 [ r1 ] [ j ] ; }

74 e l s e { i n t r2=rand ( )%Pn2+1;

75 Lnd1 [ i ] [ j ]= pop2 [ r2 ] [ j ] ; } } }

76 //−−− b u t t e r f l y adjus t