Realization and simulation of parallel ant colony algorithm to solve WTA problem

In order to resolve the problem that ant colony algorithm solves large-scale WTA (weapon-target assignment) problem will consume a large amount of time, a parallel ant colony algorithm is proposed. Making full use of OpenMP parallel optimization technology, coarse-grained parallel strategy, and the advantage of multi-core in PC, take the cyclic iteration and cyclic assignment, which is the main time-consuming part of ant colony algorithm, into parallel processing. The simulation results demonstrate that the proposed parallel ant colony algorithm is efficiency to solve the large-scale WTA problem, improve the search rate for the optimal solution greatly, can satisfy the real-time requirement for WTA decision.