A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr class="thead"><td align="left">Partition (<svg height="12.175" id="M202" style="vertical-align:-2.29482pt" version="1.1" viewbox="0 0 9.2875004 12.175" width="9.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="M516 277q0 -126 -140 -231q-36 -27 -75.5 -42.5t-63.5 -15.5q-38 0 -73 43q-10 -44 -18 -106q-18 -134 -32 -151q-12 -16 -40 -25t-46 -10l-5 14q22 38 84 406q16 92 44.5 146.5t88.5 95.5q68 47 136 47q63 0 101.5 -47.5t38.5 -123.5zM432 259q0 61 -27 101t-79 40
t-82 -49t-49 -148l-24 -127q42 -36 88 -36q79 0 126 61.5t47 157.5z" id="x1D70C"></path></g>
</svg>)</td><td align="center">Cost</td><td align="center">Success rate</td><td align="center">CPU time</td></tr><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td align="left">4</td><td align="center">1032.9</td><td align="center">0.966666667</td><td align="center">1.089747617</td></tr><tr><td align="left">6</td><td align="center">1006.4</td><td align="center">0.98245614</td><td align="center">1.075849966</td></tr><tr><td align="left">8</td><td align="center">1021.5</td><td align="center">0.970175439</td><td align="center">1.085799014</td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

The results obtained by different partition granularities (<svg height="12.175" id="M200" style="vertical-align:-2.29482pt" version="1.1" viewbox="0 0 9.2875004 12.175" width="9.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="M516 277q0 -126 -140 -231q-36 -27 -75.5 -42.5t-63.5 -15.5q-38 0 -73 43q-10 -44 -18 -106q-18 -134 -32 -151q-12 -16 -40 -25t-46 -10l-5 14q22 38 84 406q16 92 44.5 146.5t88.5 95.5q68 47 136 47q63 0 101.5 -47.5t38.5 -123.5zM432 259q0 61 -27 101t-79 40
t-82 -49t-49 -148l-24 -127q42 -36 88 -36q79 0 126 61.5t47 157.5z" id="x1D70C"></path></g>
</svg>) when <svg height="11.125" id="M201" style="vertical-align:-0.17555pt" version="1.1" viewbox="0 0 57.549999 11.125" width="57.549999" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M545 106q-67 -118 -134 -118q-24 0 -40 37.5t-30 129.5h-2q-47 -72 -103 -119.5t-108 -47.5q-47 0 -76 45.5t-29 119.5q0 113 85 204t174 91q47 0 70 -33.5t43 -119.5h3q32 47 80 140l55 13l10 -9q-47 -80 -138 -201q17 -99 27.5 -136t22.5 -37q23 0 69 61zM333 204
q-14 98 -31 149.5t-50 51.5q-49 0 -94 -70t-45 -164q0 -55 15.5 -86t40.5 -31q70 0 164 150z" id="x1D6FC"></path></g><g transform="matrix(.017,-0,0,-.017,14.426,10.862)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,29.13,10.862)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g><g transform="matrix(.017,-0,0,-.017,37.29,10.862)"><path d="M113 -12q-24 0 -39.5 16t-15.5 42q0 24 16 40.5t40 16.5t40 -16.5t16 -40.5q0 -26 -16 -42t-41 -16z" id="x2E"></path></g><g transform="matrix(.017,-0,0,-.017,41.165,10.862)"><path d="M241 635q53 0 94 -28.5t63.5 -76t33.5 -102.5t11 -116q0 -58 -11 -112.5t-34 -103.5t-63.5 -78.5t-94.5 -29.5t-95 28t-64.5 75t-34.5 102.5t-11 118.5q0 58 11.5 112.5t34.5 103t64.5 78t95.5 29.5zM238 602q-32 0 -55.5 -25t-35.5 -68t-17.5 -91t-5.5 -105
q0 -76 10 -138.5t37 -107.5t69 -45q32 0 55.5 25t35.5 68.5t17.5 91.5t5.5 105t-5.5 105.5t-18 92t-36 68t-56.5 24.5z" id="x30"></path></g><g transform="matrix(.017,-0,0,-.017,49.325,10.862)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg>.

Journal of Applied Mathematics

tab2

Table 2

Table 2: A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks 