针对遗传算法在解决武器目标分配问题时存在的缺点，提出了将贪心机制应用于遗传算法解决该问题的思路，即贪心遗传算法.在建立武器目标分配问题数学模型的基础上，探讨将贪心算法思想作为确定性选择原则指导遗传操作实施解空间搜索，分析了贪心遗传算法的编码、生成初始种群，贪心交叉、贪心变异等过程的原理和算法实现流程，应用贪心遗传算法进行了战斗实例计算.结果表明该方法是可行的，避免了遗传算法早熟收敛和封闭竞争的问题，计算量小、算法稳定.

The problem of weapon target assignment is an important research task for operation decision making. On the basis of analyzing the existing shortcoming of genetic algorithm (GA) solving the problem, greedy genetic algorithm (GGA) that greedy mechanism is applied to GA was proposed. By constructing the mathematical model of weapon target assignment (WTA), establishing certain selection principle of GGA idea when guiding genetic operation searching was discussed. Principle of coding, generating initial population, greedy crossover and greedy mutation process of GGA and its implementation flow were analyzed. GGA was adopted to an example, and the result shows that GGA is feasible. It avoids the slow convergence and enclosure completion, and computes stably with a little computation cost.