Abstract

http://ssrn.com/abstract=489802
 
 

References (23)



 


 



Exact and Heuristic Methods for the Weapon Target Assignment Problem


Ravindra K. Ahuja


University of Florida - Department of Industrial and Systems Engineering

Arvind Kumar


University of Florida - Department of Industrial and Systems Engineering

Krishna Jha


University of Florida - Department of Industrial and Systems Engineering

James B. Orlin


Massachusetts Institute of Technology (MIT) - Sloan School of Management

July 2003

MIT Sloan Working Paper No. 4464-03

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.

Number of Pages in PDF File: 21

Keywords: Weapon Target Assignment, WTA, very large-scale neighborhood search algorithm

working papers series


Download This Paper

Date posted: April 20, 2004  

Suggested Citation

Ahuja, Ravindra K. and Kumar, Arvind and Jha, Krishna and Orlin, James B., Exact and Heuristic Methods for the Weapon Target Assignment Problem (July 2003). MIT Sloan Working Paper No. 4464-03. Available at SSRN: http://ssrn.com/abstract=489802 or http://dx.doi.org/10.2139/ssrn.489802

Contact Information

Ravindra K. Ahuja (Contact Author)
University of Florida - Department of Industrial and Systems Engineering ( email )
303 Weil Hall
Gainesville, FL 32611-6595
United States
Arvind Kumar
University of Florida - Department of Industrial and Systems Engineering ( email )
303 Weil Hall
Gainesville, FL 32611-6595
United States
Krishna Jha
University of Florida - Department of Industrial and Systems Engineering ( email )
303 Weil Hall
Gainesville, FL 32611-6595
United States
James B. Orlin
Massachusetts Institute of Technology (MIT) - Sloan School of Management ( email )
E53-357
Cambridge, MA 02142
United States
617-253-6606 (Phone)
617-258-7579 (Fax)
Feedback to SSRN


Paper statistics
Abstract Views: 3,461
Downloads: 484
Download Rank: 31,316
References:  23

© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollo4 in 0.407 seconds