A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution

<table class="table-group" id="tab11"><tr><td><table class="table"><tr><td class="thead-hr" colspan="8"><hr/></td></tr><tr class="thead"><td align="left">Algorithm</td><td align="center">SPSO2011</td><td align="center">CMAES</td><td align="center">ABC</td><td align="center">JDE</td><td align="center">CLPSO</td><td align="center">SADE</td><td align="center">HBD</td></tr><tr><td class="thead-hr" colspan="8"><hr/></td></tr><tr><td align="left">Ranking</td><td align="center">4.06</td><td align="center">5.24</td><td align="center">3.58</td><td align="center">4.44</td><td align="center">4.60</td><td align="center">3.42</td><td align="center"><b>2.66</b></td></tr><tr class="table-tr"><td colspan="8"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Average ranking of seven algorithms by the Friedman test for CEC2005 functions at <svg height="9.21094pt" id="M400" style="vertical-align:-0.2129908pt" version="1.1" viewbox="-0.0498162 -8.99795 39.1241 9.21094" width="39.1241pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z" id="g113-69"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="766" vert-adv-y="766"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,14.163,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z" id="g117-34"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="587" vert-adv-y="587"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,25.901,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,32.404,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g></svg>.

Mathematical Problems in Engineering

tab11

Table 11

Table 11: A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution 