2020 IEEE Congress on Evolutionary Computation, CEC 2020, Virtual, Glasgow, Birleşik Krallık, 19 - 24 Temmuz 2020
© 2020 IEEE.Weapon-target assignment (WTA) is a combinatorial optimization problem in the NP-hard category. The problem is to assign targets to weapons in order to ensure that the targets are eliminated with weapons in the most effective way. This problem, which can be discussed on different scenarios, is called static or dynamic according to the definition of the problem. In this study, the target value and hit probability values will be assigned according to the position of the target and the weapon. The WTA problem will be analyzed in different cases and solved using optimization algorithms. Howitzer will be chosen as weapon and four different types of targets will be offered to get solutions through different scenarios. Three different WTA problems will be examined. The first two scenarios will be solved with single-objective optimization algorithms, and the last case will be modeled as a multi-objective optimization problem.