Solving Weapon-Target Assignment Problems by a New Ant Colony Algorithm | IEEE Conference Publication | IEEE Xplore

Solving Weapon-Target Assignment Problems by a New Ant Colony Algorithm


Abstract:

A new ant colony algorithm for weapon-target assignment (WTA) problems is proposed. The proposed algorithm is a parallel mechanism based on ant colony optimization (ACO) ...Show More

Abstract:

A new ant colony algorithm for weapon-target assignment (WTA) problems is proposed. The proposed algorithm is a parallel mechanism based on ant colony optimization (ACO) and has cooperative interactions among ant colonies. It has both the advantage of ACO, the ability to find feasible solutions and to avoid premature convergence, and the advantage of heuristics, the ability to conduct fine-tuning to find better solutions. A comparison of the proposed algorithm with several existing search approaches shows that the new algorithm outperforms its competitors on all tested WTA problems.
Date of Conference: 17-18 October 2008
Date Added to IEEE Xplore: 22 December 2008
Print ISBN:978-0-7695-3311-7
Conference Location: Wuhan, China
References is not available for this document.

1. Introduction

The WTA (weapon-target assignment) problem is to find a proper assignment of weapons to target s with the objective of minimizing the expected operational loss of the warship formation. It is an important task for the commanders to make a proper WTA to defend own warships. Optimization of WTA problem is the key content of air defense operational command and control. It has been shown that a WTA problem is a NP-compete problem, and it is difficult to solve this type of problems directly.

Select All
1.
H.P.Cai, J.X Liu, Y.W. Chen, and H. Wang, "Survey of the research on dynamic weapon-target assignment problem", Journal of Systems Engineering and Electronics, Vol.17, no.3 (2006),pp.559-565
2.
E. Wacholder, "A neural network-based optimization algorithm for the static weapon-target assignment problem", ORSA Journal on Computing,4(1989),pp.232-246
3.
J.L. Ressler, and M.F. Augusteijn,"Weapon target assignment accessibility using neural networks", Intelligent Engineering Systems Through Artificial Neural Networks, 2(1992),pp.397-402
4.
A.C. Cullenbine, "A Taboo search approach to the weapon assignment model. Department of Operational Sciences", Air Force Institute of Technology, (2000),pp. 1-103
5.
H.R. Li, and Y. Miao, "WTA with the maximum kill probability based on simulated annealing algorithms", The Special Committee of C2 and Computer of the Electronic Technology Academic Committee of China, Ship Engineering Society. Academica Conference,(2000),pp.436-440
6.
Z.J. Lee, S.F. Su, and C.Y. Lee, "Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics", IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics,Vol.33, no.1(2003),pp.113-121
7.
Z.J. Lee, S.F. Su, and C.Y. Lee, "A genetic algorithm with domain knowledge for weapon-target assignment problems", Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers, Series A, Vol.25,no.3(2002),pp.287-295
8.
Z.J.Lee, C.Y.Lee, and S.F. Su, "An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem", Applied Soft Computing Journal, Vol.2,no.1(2002),pp.39-47
9.
S. Gao, and J.Y.Yang, "Solving weapon-target assignment problem by particle swarm optimization algorithm", Systems Engineering and Electronics, Vol. 27,no.7(2005),pp.1250-1252,1259
10.
L. Jiao, and L. Wang, "Novel genetic algorithm based on immunity", IEEE Transactions on Systems, Man and Cybernetics, Part A, Vol 30,no.5(2000),pp.552 -561
Contact IEEE to Subscribe

References

References is not available for this document.