A Novel Ant Colony Optimization Algorithm for Large Scale QoS-Based Service Selection Problem

Algorithm 1

ACO_Basic.

   Set parameters and Initialize pheromone trails

Begin

   𝑏𝑒𝑠𝑡𝐴 = {};      //Take cost({})=∞;

   repeat

    for each ant k do

      construct an assignment 𝐴_𝑘;

       if fit(𝐴_𝑘) < fit(𝑏𝑒𝑠𝑡𝐴) then

         𝑏𝑒𝑠𝑡𝐴=𝐴_𝑘;

    endfor;

    update pheromone trails;

   until the maximum evaluation number is arrived or

     the other termination condition is satisfied;

   return  𝑏𝑒𝑠𝑡𝐴;

End