贪心遗传算法解决一般武器-目标分配问题

The Greedy Algorithm Resolves the General Weapon-target Assignment Problem

一般武器-目标分配问题,是使武器发挥最大效能而使目标遭受最大毁伤的最优化问题。遗传算法广泛用于解决最优化问题。提出一种具有贪心优化机制的局部搜索方法,以提高遗传算法的搜索效率,从而迅速找到全局最优解。应用于炮兵武器-目标分配问题的仿真试验结果表明,此算法比现有的其他搜寻算法具有更好的求解效率。

A general weapon-target assignment （WTA） problem is asks to cause the weapon display biggest potency to cause the target to suffer the biggest destruction the weapon-target optimal assignment problem. The genetic algorithm （GA） widely uses in solving the optimization assignment problem. The article proposed one kind has the greed optimization mechanism partial reconnaissance method, Enhances the genetic algorithm the search efficiency, Thus found the overall situation optimal solution rapidly. Applies indicated in the artillery weapon-target assignment problem simulation test result, This algorithm has the better solution efficiency compared to the existing other search algorithm.