As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Weapon-target allocation (WTA) is a typical constrained combinatorial optimization problem, which is an important content of command and decision in air defense operation. WTA is known to be NP-complete problem, and the intelligent optimization methods are widely employed to solving it. A popular coding length is n*m corresponding to assigning n weapons to m targets. However, the coding length will increase greatly with the problem scale growing, and the computation is too heavy to meet the real-time requirements. This paper focuses on designing a new gene coding to improve computational efficiency. In our study, a sequence of weapons serves as gene coding, which is attached the two other codes, target code and capacity code respectively. This coding length is n and adapts to the constraints of WTA effectively. Then the operators of gene selection, crossover and mutation are designed. On the other hand, the maximum operational effectiveness is defined as the object function with the minimum consumption of ammunition. This model is based on multi-objective optimization, and is more realistic. An example shows that the method is feasible and can save computing time greatly.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.