MEEF: A Minimum-Elimination-Escape Function Method for Multimodal Optimization Problems

<div>2D example: minimum-escape function for the flattened problem (FGP) at the current best solution <svg height="10.7394pt" id="M71" style="vertical-align:-0.2130003pt" version="1.1" viewbox="-0.0498162 -10.5264 14.0158 10.7394" width="14.0158pt" 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="M536 404C536 423 520 448 491 448C445 448 398 404 308 283L286 338C255 416 242 448 217 448C182 448 138 402 92 341L111 321C149 368 169 378 178 378C188 378 198 363 214 320L254 212C185 117 138 65 107 65C98 65 85 69 82 75C79 82 73 86 65 86C44 86 23 60 23 39C23 7 44 -12 71 -12C119 -12 168 33 265 177L306 61C321 17 347 -12 373 -12C413 -12 465 33 507 96L491 119C459 84 432 60 413 60C395 60 378 92 358 148L321 250C341 279 369 310 389 332C417 363 439 382 456 382C466 382 475 376 481 368C486 361 492 358 496 358C513 358 536 381 536 404Z" id="g113-121"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="559" vert-adv-y="559"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,7.574,-5.984)"><path d="M486 158C486 177 478 202 466 220C413 228 386 236 336 262C386 288 413 297 466 304C478 323 486 347 485 366C470 376 444 381 422 380C389 338 368 319 321 288C323 345 329 372 349 422C339 442 322 461 305 470C289 461 271 442 262 422C281 372 287 345 290 288C243 319 222 338 189 380C167 381 142 376 125 366C125 347 133 322 145 304C198 296 225 288 275 262C225 236 198 227 145 220C133 201 125 177 126 158C141 148 167 143 189 144C222 186 243 205 290 236C288 179 282 152 262 102C272 82 289 63 306 54C322 63 340 82 350 102C330 152 324 179 321 236C368 205 390 186 422 144C444 143 470 148 486 158Z" id="g50-43"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="611" vert-adv-y="611"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig5

Figure 5

Figure 5: MEEF: A Minimum-Elimination-Escape Function Method for Multimodal Optimization Problems 