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

Procedure 1

Updating the pheromones.

Begin

   for  each vertex v in the construction graph  do

     𝜏(𝑣)=(1−𝜌)⋅𝜏(𝑣)+∑_{𝐴𝑘∈𝐸𝑙𝑖𝑡𝑖𝑠𝑡𝑜𝑓𝐶𝑦𝑐𝑙𝑒}Δ𝜏(𝐴_𝑘,𝑣)

     if  𝜏(𝑣)<𝜏_min  then  𝜏(𝑣)=𝜏_min;

     if  𝜏(𝑣)<𝜏_max  then  𝜏(𝑣)=𝜏_max;

   endfor

End