This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Exact and Heuristic Methods for the Weapon Target Assignment Problem

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Ahuja, Ravindra
Kumar, Arvind
Jha, Krishna
Orlin, James
Abstract

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-complete. There do not exist any exact methods for the WTA problem which can solve even small size problems (for example, with 20 weapons and 20 targets). Though 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 linear programming, integer programming, and network flow based lower bounding methods using which we obtain several branch and bound algorithms 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 size 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.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/1721.1/7388
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Massachusetts Institute of Technology (MIT), Sloan School of Management in its series Working papers with number 4464-03.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 10 Dec 2004
Date of revision:
Handle: RePEc:mit:sloanp:7388

Contact details of provider:
Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA
Phone: 617-253-2659
Web page: http://mitsloan.mit.edu/
More information through EDIRC

Order Information:
Postal: MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), SLOAN SCHOOL OF MANAGEMENT, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA

For technical questions regarding this item, or to correct its listing, contact: (Christian Zimmermann).

Related research
Keywords: Weapon Target Assignment; WTA; very large-scale neighborhood search algorithm;

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? About 1000 archives contribute their bibliographic data to RePEc.

This page was last updated on 2010-1-3.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.