Research Article
A Hybrid Artificial Bee Colony Algorithm for the Service Selection Problem
Begin | for each current food source do | Compute its attractive probability according to (5); | endfor; | int ; | int ; | while () do | repeat | ; | generate a random value ; | if () then ++; endif; | until (); | //make exploitation for the food source , and adjust the binding mode | bool improved = true; | int ; | ++; //increment the trial number of food source , by 1 | while ( improved ) do | = randomInt(1, .); /*Generate a random number between 1 and */ | ; | Random select a candidate from the cluster containing the current binding service ; | Bind with the vertex of to replace ; | if ( then | improved = false; | ; | else | ; | endif; | endwhile; | ++; | endwhile | End. |
|