Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm

<table>Comparison results of the tree cost between RNN and MCMRACO and between GA and MCMRACO with different values of <svg height="7.9499998" id="M289" style="vertical-align:-0.1638pt" version="1.1" viewbox="0 0 8.2875004 7.9499998" width="8.2875004" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M457 332q0 -81 -41 -161.5t-105.5 -131.5t-129.5 -51q-46 0 -79 30.5t-33 86.5q0 18 7 51q18 95 46 187q6 19 6 33q0 7 -7 7q-24 0 -78 -64l-20 23q32 48 73 77t78 29q33 0 33 -46q0 -38 -10 -70q-28 -92 -39 -152q-7 -38 -7 -57q0 -78 69 -78q68 0 118 75.5t50 194.5
q0 43 -12 57q-11 12 -11 24q0 19 15 35.5t34 16.5q18 0 30.5 -34.5t12.5 -81.5z" id="x1D463"></path></g>
</svg> when the initial MR network is B18.</table>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: Minimum Cost Multicast Routing Using Ant Colony Optimization Algorithm 