A Hybrid Artificial Bee Colony Algorithm for the Service Selection Problem

Algorithm 1

-ABC.

Parameter

  int  Max_cluster_number;

  int   Min_cluster_number;

  int  C_size; //The colony size

Begin

  for  each service class s_class   do

    Use the skyline query process to identify its skyline services ;

    if(_cluster_number)

      Use the IS process partitioning the skyline services into clusters, ;

    endif

  endfor

  Build the clustering graph CG;

  Establish an initialized binding mode;

  Initialize pheromone trails;

  Initialize the global best food source G_best randomly;

  repeat

    Send the employed bees by the Procedure 3;

    Send the onlookers and adjust the binding mode by the Procedure 1;

    Update the pheromone trails by the Procedure 4;

    Send the scouts by the Procedure 5;

    for  each current food source   do

      if   then   ;  endif;

    endfor;

  until  the maximum evaluation number is arrived or

     the other termination condition is satisfied;

  return   G_best;

End