Real-Time Heuristic Algorithms for the Static Weapon-Target Assignment Problem
Abstract
The problem of targeting and engaging individual missiles (targets) with an arsenal of interceptors (weapons) is known as the weapon target assignment problem. As many solution techniques are based upon a transformation of the objective function, their final solutions rarely produce optimal solutions. We propose a nonlinear branch and bound algorithm to provide the first optimization approach to the untransformed problem found in the literature. Further, we propose a new heuristic based upon the branch and bound algorithm which dominates other heuristics explored in optimality gap. We also propose a heuristic based upon the optimal solution to the quiz problem whichfinds solutions within 6% of optimal for small problems and provides statistically similar results as one of the best heuristics found in the literature for larger problems while solving these problems in ten thousandths of the time.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 23, 2017
- Accession Number
- AD1055142
Entities
People
- Alexander G Kline
Organizations
- Air Force Institute of Technology