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

<table>Comparison with different partition granularities (in percentage relative to <svg height="15.4625" id="M203" style="vertical-align:-2.29482pt" version="1.1" viewbox="0 0 36.862499 15.4625" width="36.862499" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.963)"><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><g transform="matrix(.017,-0,0,-.017,13.933,10.963)"><path d="M535 323h-483v50h483v-50zM535 138h-483v50h483v-50z" id="x3D"></path></g><g transform="matrix(.017,-0,0,-.017,28.637,10.963)"><path d="M137 343l67 33q37 17 63 17q79 0 129.5 -53t50.5 -131q0 -92 -58 -156.5t-147 -64.5t-147 68t-58 182q0 63 17 119t43 95.5t61.5 72t69 52t67.5 31.5q62 22 128 33l6 -32q-56 -11 -108 -35q-149 -71 -184 -231zM227 337q-47 0 -95 -27q-6 -23 -6 -70q0 -93 36 -155.5
t96 -62.5q53 0 78 45.5t25 105.5q0 68 -35 116t-99 48z" id="x36"></path></g>
</svg>).</table>

Journal of Applied Mathematics

fig6

Figure 6

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