A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem

A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem

We study the weapon-target assignment WTA problem which has wide applications in the area of defense-related operations research. This problem calls for finding a proper assignment of weapons to targets such that the total expected damaged value of the targets to be maximized. The WTA problem can be formulated as a nonlinear integer programming problem which is known to be NP-complete. There do...

ACGA Algorithm of Solving Weapon - Target Assignment Problem

Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...

The Weapon-Target Assignment Problem

Hybrid Nested Partitions method with Intelligent Greedy Search for solving Weapon-Target Assignment Problem

The Weapon-Target Assignment (WTA) problem is one of the most important problems of military applications of operations research. The objective of the WTA problem is to find proper assignments of weapons to targets which minimize the expected damage of defensive side. The WTA problem is known to be NP-complete. In this paper, hybrid Nested Partitions (NP) method is proposed to solve WTA problem...

Exact and Heuristic Methods for the Weapon Target Assignment Problem

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-com...