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

Procedure 2

Construct assignment by ant 𝑘.

Begin

  𝐴_𝑘={𝑣_𝑠};

  repeat

     Select a vertex 𝑣 from the ant feasible neighborhood with a probability;

     Move the ant to this vertex, 𝐴_𝑘 = 𝐴_𝑘∨ {𝑣};

  until (𝑣==𝑣_𝑑)

End