与单目标打击方案和发射地域相关的快速大规模火力任务分配

Assigning Massive Firing Tasks Efficiently According to Single-target Destroying Schemes and Launching Fields

实际作战任务规划中存在这样一类问题:给定一大批打击目标,每个目标都有若干单目标打击方案,每个单目标打击方案涉及的武器可能分属不同作战单位,而每个作战单位只能在有限的几个作战区域进行发射活动;在此前提下,需要在给定的武器、兵力、发射地域等诸多约束条件下,针对若干优化目标,给出单目标打击方案选择及发射地域分配.针对这一类问题,给出了详细的问题模型,设计了问题求解的遗传算法,并通过实验验证了大规模火力分配算法的快速性.

In practical operation planning, there is a class of problems, that is： giving a batch of targets, the single-target destroying schemes and launching fields, it must select related scheme for every target and assign launching field for it, according to constrains of weapons, units and fields, etc. The difficulty of these problems mostly comes from the complexity of the relations among targets,destroying schemes, operation units and launching fields. There are several destroying schemes for every target; the weapons involved in destroying schemes belong to different operation units; and every operation unit can only fire at several limited launching fields. This paper aimed at solving this class of problems. A detailed model of these problems was proposed, and a corresponding genetic algorithm was designed. The efficiency of the algorithm was presented by experiments.