A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem
2017
International Journal of Aerospace Engineering
The weapon-target assignment (WTA) problem, known as an NP-complete problem, aims at seeking a proper assignment of weapons to targets. The biobjective WTA (BOWTA) optimization model which maximizes the expected damage of the enemy and minimizes the cost of missiles is designed in this paper. A modified Pareto ant colony optimization (MPACO) algorithm is used to solve the BOWTA problem. In order to avoid defects in traditional optimization algorithms and obtain a set of Pareto solutions
doi:10.1155/2017/1746124
fatcat:bdl4p7cjwjaqvap57pw43jat6q