Search

In this work, we consider the static weapon target assignment problem which is a very hard combinatorial optimization problem has not only defense-related applications but business world applications. The aim of the weapon target assignment problem is to find an assignment of weapons to targets with the minimum total survival value of the targets. The weapon target assignment problem is known to be NP-complete problem. In this paper, we propose a hybrid artificial bee colony algorithm with simulated annealing algorithm to give an efficient solution to the weapon target assignment problem. We tested the proposed algorithm with benchmark problem instances and compared it with some other meta-heuristics in the literature. Computational tests show that our algorithm is competitive and satisfactory. [ABSTRACT FROM AUTHOR]