用直接比较策略的组合混沌遗传算法求解武器目标分配问题(英文)  

Direct Comparison-Improved Combined Chaotic Genetic Algorithm for Solving Weapon-Target Assignment Problem

作　　者：王磊[1] 倪明放[1] 杨宽泗[2] 魏厚刚[2] 于占科 

机构地区：[1]中国人民解放军理工大学通信工程学院 [2]中国人民解放军75576部队

出　　处：《系统仿真学报》2014年第1期125-131,共7页Journal of System Simulation

基　　金：National Nature Science Foundation of China(70971136)

摘　　要：武器-目标分配问题(WTA)是联合作战中一个基本问题。针对WTA模型特点提出一种改进的遗传算法。该算法设计了新的编码策略,有效减少了模型的约束数目,并采用直接比较法处理约束,将问题转换成无约束优化问题。在遗传操作中设计了相应的组合混沌序列发生器,提高了种群质量,加快了收敛速度,结合二次插值法进行局部搜索提高了算法性能。数据实验结果表明该算法在可接受的时间内求得较高质量的解。The Weapon Target Assignment （WTA） problem is a fundamental one in Joint- Operation. An improved genetic algorithm was developed, which was specifically designed to the WTA problem. A new encoding strategy was designed to reduce the number of constraints effectively. Sequentially, after the direct comparison method was used to operate constraints, the original problem was transformed into an unconstrained one. Corresponding combined chaotic sequence was designed to make crossover and mutation operations, which could improve the population quality and quicken convergence speed. Moreover, Quadratic interpolation was used to perform local exploitation. The computational efforts indicate that the proposed solution method is effective and can find high quality solutions for the WTA problem in reasonable amount of time.

关 键 词：武器目标分配 遗传算法 直接比较法 混沌 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]