Paper Info
Title
An immunity-based ant colony optimization algorithm for solving weapon–target assignment problem
Abstract
In this paper, an immunity-based ant colony optimization (ACO) algorithm for solving weapon–target assignment (WTA) problems is proposed. The WTA problem, known as a NP-complete problem, is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force assets. The general idea of the proposed algorithm is to combine the advantages of ACO, the ability to cooperatively explore the search space and to avoid premature convergence, and that of immune system (IS), the ability to quickly find good solutions within a small region of the search space. From our simulation for those WTA problems, the proposed algorithm indeed is very efficient.
Year
DOI
Venue
2002
10.1016/S1568-4946(02)00027-3
Applied Soft Computing
Keywords
Field
DocType
Ant colony optimization,Optimization,Immune system,Weapon–target assignment
Weapon target assignment problem,Ant colony optimization algorithms,Mathematical optimization,Quadratic assignment problem,Meta-optimization,Generalized assignment problem,Algorithm,Assignment problem,Artificial intelligence,Linear bottleneck assignment problem,Mathematics,Metaheuristic
Journal
Volume
Issue
ISSN
2
1
1568-4946
Citations 
PageRank 
References 
61
3.79
12
Authors
3
Name
Order
Citations
PageRank
Zne-Jung Lee194043.45
Chou-Yuan Lee229517.36
Shun-Feng Su3119497.62