基于遗传算法的一类武器目标分配方法研究

Research on approach for a type of weapon target assignment problem solving by genetic algorithm

针对联合作战的武器目标分配问题,建立了资源受限条件下的多组武器目标分配数学模型,并研究了用遗传算法求解模型的方法。该遗传算法通过设计一种满足约束条件的染色体编码格式,把求解问题转化为无约束的组合优化表现形式,从而可以利用单点随机定位算术交叉和变异运算以及精华选择策略来求解。仿真计算结果表明了模型和所提算法的有效性。

After introducing a new definition that the available weapon may attack target, a model is proposed for the problem of multi-team weapon target assignment （MT-WTA） with the restrictive use of weapon resource. Because it can not be solved by the common method, the genetic algorithm （GA） is used to solve this model. In this algorithm, a novel coding format of chromosomes is first designed to translate the problem to be solved into the form of combination optimization problem without constraints. After that, a process of arithmetic cross between two bits is designed which a bit is random fixed and another one place will depend on the fore bit. Similarly, the mutation process is designed by means of the random bit. Finally, genetic search is led to the best area of feasibility by the proportion and elite election strategy. The computational results demonstrate that it can get a satisfactory solution.