Abstract:

Aiming at the uncertainties in weapon-target assignment(WTA), the dynamic weapon-target assignment(DWTA) problem with the uncertain number and types of targets is studied. Firstly, the deterministic WTA model is built on the minimum total cost of the mission. Secondly, with time variable and scenario mode and conditional value-at-risk(CVaR) constraint, a deterministic WTA problem is transformed into two-stage DWTA problem with CVaR constraint. The DWTA problem can be formulated as a mixed-integer programming(MIP) problem when the CVaR constraint is represented by a set of linear inequalities. Finally, a kind of cyclic multiexchange tabu search(CME-TS) algorithm is designed to solve a more large-scale DWTA problem, and the simulation result shows that new algorithm can solve it in a short time.