Name
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 methods to solve the general weapon-target assignment problem. Our computational results show 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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.2514/1.34254 | JOURNAL OF AEROSPACE COMPUTING INFORMATION AND COMMUNICATION |
Keywords | Field | DocType |
assignment problem | Weapon target assignment problem,Mathematical optimization,Heuristic,Quadratic assignment problem,Generalized assignment problem,Personal computer,Control engineering,Assignment problem,Engineering,Null-move heuristic,Linear bottleneck assignment problem | Journal |
Volume | Issue | ISSN |
6 | 6 | 1940-3151 |
Citations | PageRank | References |
9 | 0.63 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Azad M. Madni | 1 | 188 | 34.57 |
| Mircea Andrecut | 2 | 73 | 8.52 |