Abstract
The weapon‐target assignment problem is a fundamental defense application of operations research. The problem consists of optimally assigning a given number of weapons to a set of targets, so that the post-engagement total expected survival value of the targets is minimized. Since the weapon‐target assignment problem is known to be nondeterministic polynomial time-complete, there are no exact methods to solve it. This paper presents two innovative heuristic algorithms based on simulated annealing and threshold accepting methodstosolvethegeneralweapon‐targetassignmentproblem.Ourcomputationalresultsshow that by using these algorithms, relatively large instances of the weapon‐target assignment problem can be solved near-optimally in a few seconds on a standard personal computer.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Aerospace Computing, Information, and Communication
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
