Design of Fixed and Ladder Mutation Factor-Based Clonal Selection Algorithm for Solving Unimodal and Multimodal Functions

<table>Convergent performances on generalized Schwefel’s Problem 2<b>.</b>26 (<svg height="16.6625" id="M152" style="vertical-align:-3.56265pt" version="1.1" viewbox="0 0 27.362499 16.6625" width="27.362499" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.162)"><path d="M619 670q0 -13 -9 -26t-18 -19q-13 -10 -25 2q-36 38 -66 38q-31 0 -54.5 -50t-45.5 -185h120l-20 -31l-107 -12q-23 -138 -57 -293q-27 -122 -55 -184.5t-75 -109.5q-60 -61 -114 -61q-25 0 -47.5 15t-22.5 31q0 17 31 44q11 8 20 -1q10 -11 31 -19t35 -8q26 0 47 19
q34 34 71 253l54 315h-90l-3 12l31 30h70q28 138 90 204q35 37 75 57.5t70 20.5q26 0 45 -14t19 -28z" id="x1D453"></path></g><g transform="matrix(.017,-0,0,-.017,10.976,12.162)"><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,19.135,12.162)"><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>
</svg>).</table>

Applied Computational Intelligence and Soft Computing

fig12

Figure 12

Figure 12: Design of Fixed and Ladder Mutation Factor-Based Clonal Selection Algorithm for Solving Unimodal and Multimodal Functions 