Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm

Algorithm 1

Pseudocode of Floyd’s algorithm.

Floyd's Algorithm

Input: 𝐂_{|𝑉𝐺|×|𝑉𝐺|}[𝑐_𝑖𝑗]: the cost matrix of the network graph

Output:  𝐂_{|𝑉𝐺|×|𝑉𝐺|}[𝑐̂_𝑖𝑗]: the cost matrix of the cost complete graph (CCG)

    𝐎_{|𝑉𝐺|×|𝑉𝐺|}[𝑜_𝑖𝑗]: records the next node on the minimum cost route

    from node 𝑖 to node 𝑗

For  𝑖∶=1  to  |𝑉_𝐺|

  For  𝑗∶=1  to  |𝑉_𝐺|

   𝑐̂_𝑖𝑗=𝑐_𝑖𝑗;

   If  𝑐_𝑖𝑗=∞

     𝑜_𝑖𝑗∶=−1;

   Else

     𝑜_𝑖𝑗∶=𝑗;

   End  If

  End  For

End  For

For  𝑘∶=1  to  |𝑉_𝐺|

  For  𝑖∶=1  to  |𝑉_𝐺|

   For  𝑗∶=1  to  |𝑉_𝐺|

    If  𝑖≠𝑗  and  𝑐̂_𝑖𝑘+𝑐̂_𝑘𝑗<𝑐̂_𝑖𝑗

     𝑐̂_𝑖𝑗∶=𝑐̂_𝑖𝑘+𝑐̂_𝑘𝑗;

     𝑜_𝑖𝑗∶=𝑜_𝑖𝑘;

    End  If

   End  For

  End  For

End  For