A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem

<div>Plots of PSs best performance in 30 runs of four algorithms on Scale <svg height="8.55521pt" id="M310" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.34882 6.36303 8.55521" width="6.36303pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z" id="g113-52"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g></svg>.</div>

International Journal of Aerospace Engineering

fig7

Figure 7

Figure 7: A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem 