This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Ahuja, R. K. Articles by Orlin, J. B. Search for Related Content

Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem

Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
Innovative Scheduling, Inc., Gainesville, Florida 32641
Innovative Scheduling, Inc., Gainesville, Florida 32641
Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
ahuja{at}ufl.edu
arvind{at}innovativescheduling.com
krishna{at}innovativescheduling.com
jorlin{at}mit.edu

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 minimal. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. No exact methods exist for the WTA problem that can solve even small-size problems (for example, with 20 weapons and 20 targets). Although several heuristic methods have been proposed to solve the WTA problem, due to the absence of exact methods, no estimates are available on the quality of solutions produced by such heuristics. In this paper, we suggest integer programming and network flow-based lower-bounding methods that we obtain using a branch-and-bound algorithm for the WTA problem. We also propose a network flow-based construction heuristic and a very large-scale neighborhood (VLSN) search algorithm. We present computational results of our algorithms, which indicate that we can solve moderately large instances (up to 80 weapons and 80 targets) of the WTA problem optimally and obtain almost optimal solutions of fairly large instances (up to 200 weapons and 200 targets) within a few seconds.

Subject classifications: military; targeting; programming; nonlinear; networks; heuristics.
History: Received July 2003; revision received September 2005; accepted February 2007.