n of the 19.The ric ALB ficial at as into gaourives tines Inhoney cal. stead, they trans! ‘his is an example of fa and storing Forthe system to function efficiently, there must be foragers and receivers. Somet ‘ehted to husband and wife managing things, ciently they atthe house and husband goes for work or age the activities of the home, The success in raising bold activi one. Ths type of functioning in bee ‘ased on the reactions of foragers to t Ifa forager waits a long time A returning nectar forager is more more nectar receivers, ifs receiver bee [25]. This recruits in-nest 2 foragers more likely © ers to foraging and tells © into the nest, where ef : a geesing av vow it ies aroun sy Wr back to the nes ‘Swarm intetigen Syetar yyy EE COLONY SYSTEM ny (ABC) algorithm is @ swarm-based meta-heu wiuced for optimizing numerical problems. It has bees mutating the intelligent behaviour of honeybees. An fmaporaad jour of bee colony is their foraging behaviour and, particu- ‘din a multi-dimensional search space and finding the food t. Jonathan Swift [24] has quoted, “We have chosen to .d wax; thus furnishing mankind with the two noblest 1 bee colo with honey an which are sweetness and light’. tee colonies, nectar foragers do not unload their nectar direetly into Jer it to receiver (storer) bees, who then place it in cells. -k partitioning (Fig. 8.20). That is, the task of collecting ar is divided into collecting and storing sub-tasks. ‘a balance in the numbers of simes the functioning of foragers and receivers can be ‘at home. It can be related how effi manage household activities effectively. The wife manages the things vvice versa or how both work and man- kids or managing the house- ‘equally balanceand share things and live as ‘olony is achieved through self-organization, ine length of time they wait to be unloaded. it is more likely to make the tremble dance. likely to make the tremble dance, which recruits i has had a long delay (search time) in being served by a bees to act as receivers. Ifthe delay is short rpake the waggle dance, which recruits additional work- them where the flowers are. Waggle dances are mainly Theor area near the entrance, Tremble dances are made further vio are younger bees. Foragers often transfer their nectar to probably do this to gain a better estimate of the average each load of nect jes depends upon how they ‘made in the dance several receivers. They en wy Bach forager can only base its decision about whether to delay in being serve apee tremble dance, or no dance oy its own “local” experience 7 Je i make a waggle dae or unlucky in how rapidly itis served, The communication and it can also be or the interaction natural di h (in jancing 8°" A2~.58 Fig. 8.20 Task partoning—optimal balancing of work formation sharing) between these bees is done through their00 Sol Computing with MATLAB Programming Fig. 8.21 Behaviour of ABC Jn ABC 26}, the model consists of three essertial components: emplayed bees foragers), unemployed bees (receivers), and food scurces (Fig, 8.21). Itclearly showy the essential parts of the model, employed bees, unemployed bees, and food sources and dancing area, Employed bees fly around in a multi-dimensional search space and choose their food sources depending on their own experience. Once the employed bees complete their search process, i shares their food source information with une ployed bees or onlooker bees waiting inthe hive by dancing inthe dancing are, Onlooker bees probabilistically choose their food sources depending on this information gained from the employed bees using Eq (8.38). IF there i 0 improvement in the food source (fitness), then the scout bees fly and choose te food sources randomly without using experience. (0.9% ft, Imax(fit))+0.1 (839) where ft, isthe fitness value ofthe solution p, which is proportional tothe nett amount of the food source in the position p, and fis the number of food sources which is equal to the number of employed bees, r,..Now the onlookers produce? ‘modification inthe position selected by it using Ea, (8.39) and evaluate the nts amount of the new source. 60 70 pq + Gag pg) where fe {1,2...1,} and q € {1, 2...D} are randomly chosen indexes. Although fis determined randomly, it has to be different from P and D i number of parameters to be optimized. g, is a random number generated be" and 1, Itcontots the production of neighbsurhood food sources. I the nectar of the new source is higher than that of the previous one, the onlookers fe" the new positon; otherwise it retains the old one In other words eed method is employed as the selection operation betveen old and new food = Ifa solution representing a food source is not improved by a predeter™! bet of tials, then that food source is abandoned toa the canted vee otSwarm neice System ga, " ‘ith that food source becomes a scout, ofa fer tas letinga tort contol panes vars fom Oo 100 rte a ones oe £9. (84D. Source, using d= %anin* POMOC pa Syn) On where yin ANG Xypgy APE the minimum and maxima te optimized, There are four control parameters used the number of employed bees, number of unemployed or onlooker bees, the ng salu andthe colony size, Thus, ABC system combines leal search cried out by employed and onlooker bees, and plobal search managed by onlookers and scouts am limits ofthe parameter to in ABC algorithm. They are red bees tempting to balance exploration and exploitation process, ly shows ‘ of AB paste 884 Working of ABC dace and Let us understand the working of ABC algorithm with the following example, mployed mol hun Se Inthis example, we discuss the basic features of ABC algorithm for optimizing a ae simple one-variable function. Let us consider the same function similar to the one ing on discussed in Section 7.4, re is no jose the Min f(x) =x-sin (102-x) + 1.0 (8.42) Subject to 639) Sxs2 Step 1: Initialization of ABC Control Parameters Number of colony =10 Employed bees: Number of colony/2 = 5 (half the colony size selected) Unemployed bees = Employed bees = Number of colony/2 = 5 Limit value LC Given: Number of variables = 1 (X) Upper limit ofthe variable: [2] Lower limit of the variable: (-1] in lengt itial Generation of Poy ulation : limit Where pt RUMber for the variable X,_(¥,,) within the upper and lower 2 7mbe of employed bees and is numberof variables. Hereee Variables = X,, [-1.000000000000000 2.000000000000000 ~0.267158235179544 1.284153871219337 0.188660719138083} oe Corresponding objective value and ftne ated in step 2 and are given here: Obj= [0.999999999999999 10.999999999999995 Fit= 0.448576242547974 0,382672750861653 0.517008250973687] Model calculation for the Ist value X(1,1) = -1.000000000000000 E < Step 4: Set iteration = 1 | Employed Bee Phase | Step 5: Modification of Selection of Site by Employed Be* Here modification of posi ried out by the Eq, (8.40). fo) =n +4 C—An) ae where fe {I, 2... n,Jare randomly chosen indices. Although fis #7" yy domly it has tobe different fom p. ®, is random number generated DME of Here, we have to generate two random values to modify the Po employed bee.‘Swarm niger Sytem 603 Bonerated 10 choose a with respect to neigh contro neighbour variable (ie, ur variable), '¢ Production of neighbourhood food ih respec tothe (843) gener. ==1+ 00815 x ( =-1.0597 + Nothing but ©, Hence using Eg. (8-44), we XQ,1) = 4Q,1) +-0.4704 x = 2 ~ 0.4704 x (2 — (0.1887) = 1.1478 are taken from step 2. Employed bee 3: It means p =3 Generated first random value: 2 (i.,f=2) + Itmeans, we are goit the variable (i.e..X@,1)) with respect to the neighbour variable 2 Generated second random value: ~0.47529(263581540 + Nothing but value Hence using Eq. (8.44), we have the fol a4) (3,1) = XG,1) — 0.7615 x (XB,1) - XC or =-0.2671 ~ 0.4752 x (-0.2671 ~ 2) ol: =0.8105 sf on” Note: Here X@3,1) and X(,1) values are taken from stp 2604 Soft Computing wth MATLAB Programming Employed bee 4: 1eans, we are going to modify the to the neighbour variable 5 (ie., X( Generated second random value: 0.291 103749945047 + Nothing but ®, value Hence using Eq. (8:44), we Employed bee 5: It means p =5 Generated first random value: 3 (ie., f= 3) + Itmeans, we are going to modify the second variable (1e., X15, to the neighbour variable 3 (i, X(3,1)) Generated second random value: 0,278633922080217 + Nothing but, value Hence using Eq. (8.44) we have MGS,1) = X51) + 0.2786 x (X65,1) = XG, + 0.2786 x (0.1886 ~ (-0.2671 = 03157 Note: Here X(5,1) and X(3,1) values are taken from step 2 ‘Now modified Employed bee variables are given as follows: ‘Variables =X, .059710975431736 147870021945455 ‘0 be fixed to~1,000000000000000) 156673421381 Note: Here all modified in the upper and lower bound. In case, its meximum value. Similarly, ‘minimum value. 42) and (8.43), the objective and fitness values are calculated values of X, ,. The final values. are given later. The model ¢3 leu ltion to calculate and Fis given in step 3 ofthis step-by-step ist Obj = 10.999999999999999 1.153670188017295 0.850825252529134) ————Dect [-1.000000000000000 1.147870021945455, 0.267158235179544 — Replaced with Old value 1,603056035829310 031 fitness of the 3rd 167342138107] ployed bee is les . ie, Hence a 3rd employed bee is replaced with fitness and objective values forthe afore- mentioned value is as follows: 06j= [0.999999999999999 301101449190 1560 —» (New objective value forthe replaced variable) 0.850825252529134] {0.500000000000000 1.145301101449190 (0.448576242547974 - 0.464323648794441 0.540299522406835) Updat iit value Here the fitness of unemployed bee 3 has lesser valu than ed in step 3. Hence the 3rd unemployed bee P« ‘od value calculated instep 3 and then inerement te limit value Fesponding unemployed bee 3. Therefore limit value, LC = [0.00+1 00] ‘Note: When itera grows, if the sount (LC) is greater’ Value i intoduced using Eq (8.41. This is nothing but everatin Yaribles similar to step 2 and introduce it with the aieady exiting ¥ the old fitness replaced with 1 for the cor- the 2, then new scout yew random ables.606 Soft Computing wit MATLAB Programming ‘Unemployed Bee Phase ‘Step 7: Recruit Onlooker or unemployed bees for selected sites ang fitness “rlaate ‘An onlooker bee evaluates 1 taken from all employed beg, and chooses ted toi fitness val ness. based sel (84s) Using the previous equation, the probabi e fness (step 5) is calculate and given here: Pro,= [0.492909776678464 1.000000000000000 0.452499982565578 0.464874602308707 0.524577929376701 ‘Step 8: Modification of Position by Onlookers and introduction of Scout bee Here we are generating one random value between (0 and 1) foreach ofthe bees. Ifthe zandomly generated value is less than the probability value calculated in the eeios step, then the unemployed or onlooker bee modifies its position using the Ea (840) Unemployed bee 1: It means p = 1 Generated random value = 0.226187679752676 Here, the generated random value is less than the probat calculated in step 7, Hence, the unemployed bee has to modify the Eq, (8.40). To modify the position again we need to generate two random values as discussed already in step 5. Generate first random va e,f=3) + Itmeans, we are going to modify the variable X(,1) with respect tothe nei bout variable 3 (ue, XC Generate second random value = ~0.496387755055374 + Nothing but &, value Hence, using Eq, (8.40) we get the following: (1) = X(1s1) + -0.4964) x OC.‘Sam nttigent System. go7 unemployed bee 2: It means p = 2 alan, Generated random ¥ YEd begs ted tone fitness. eerat £80 Generated frst ran« 84 «+ Iemeans, _ bour variable Generate the second random value =~0.596347755055374 + Nothing but ©, value, Hence using Eq. (8.40) we have the lated in step 7. Hence, Unemployed bee 4 : Generated random value = 0,837856765675564 Generated random value is greater than the probability value (0.4649) caleu- lated in step 7. Hence, the unemployed bee is same asthe one calculated in step 5 Unemployed bee S Generated random value = 0.230265467673456 1929) Generated random value is greater than the probability value (0.5246) cal: ising ated in step 7. Hence, the unemployed bee bas to mos alues 4. (8.40), To modify the position again we need to generate two random val ‘swe discussed in step 5. Generate first random value =2 (ie, f=2) sole X(5,1) with respect othe neigh- Means, we are going to modify the va our variable 5 (ie, M2, ‘Generate the second random value =—0.496387 * Nothing but ®, value Hence using Eq (8.40) we have the resulas follows AS) = X65 1) + 0.4964) x U1) = AC.) = 0.3157 + (0.4964) x (0.3157 ~ ! = 0.7287 5. © X(5,1) and X(2,1) values are taken from 6P Note: Hey _608 Soft Computing with MATLAB Programming Variables = “Bloswrasosaso00 0.65144991510000 F ~0.267158235179544 — Fet | 1.603056035829310 -> Fete 0.728727175776198) ‘Note: Here, the generated random value is greater than the probability of 3% an, + employed bees value Caeaated nlp 7, Hane the unemployed be fhe objective and fitness values are calculated for id are given later. The model calculation to 1.153670188017306 0.428448897428125) Fit= (0.491962133336701 (0.377248324606801 0.448576242547974 0.464323648794439 0.700060045410422] Now the fitne fitness of the old Position is compared withthe 7). Now, the variables which iployed and Unemployed Bee Phase are the final bee position that proceeds for next generation, ‘Table 8.7 Comparing the employed bee andunernployed bee p‘wa eign Sar gan MATLAB Program 8.4 — Part A: Main program Srna oF 186 con es; Foaterw/2; nie cyclen; ‘meoLen seecarze viRtAOLES otsfa; ba; Xaexrne Xanenation ne (reo sounees) (OF DMTTIAL PuLarioN‘S10 Soft Computing with MATLAB Programming {Foals = rand(Fooainber,0) + Range + Lover % Generation of Food sources (variable populations) @iNalefea fin, fois); ESTE sli cote fr alte fd sare Fitnessecalculateritres(ObsVal) Fitness computed for all the feed sources 2 RESET TRIAL CUNTERS ‘Initialization of bee cycle sed for neifying position f the Sthesployed bee t be different fram the previous position (4) -Foods(neghinur)) PR; ition oF the current erployed bee LUTE New sou Soyiatsrerea cosfn 01; Fitnesssol=calculateritness(ObfvalSo1); patria 1); solution i(current exployed bee) careat be ‘aproved, increase its Lint Courpo{612 Soft Computing with MATLAB Programming Af (Objval(ind)< Globaltin) 1% SCOUT BEE PHASE ‘ations/Epoch')3 nce Plot using ABC") = obj (Chrom, swite); % Dimension of objective % Compute population par end culateFitness(f00jV) '0D3V))5Result (¢ koe! (cuckoo) and the crow. re 8, ¥,823 presents some of the sequence of ceuckoo's bal caeein et of crow’s nest. THC