舰艇编队防空目标分配优化算法研究

Algorithms of Target Allocation in Naval Fleet Air Defense

针对所要解决的舰艇编队防空目标分配问题,文章结合现代防空作战特点,建立了防空目标分配模型,并讨论了数学模型的求解问题。对模拟退火算法、遗传算法、禁忌搜索算法进行了分析和研究,运用MATLAB软件编程仿真来解决所建立的防空目标分配模型。研究表明,禁忌搜索算法每次都能以100%的概率搜索到全局最优解,但由于其搜索时间过长而且搜索时间的随机性太强,不适用于解决战时的目标分配问题。而模拟退火算法和遗传算法则可以在较短的时间内达到较高的搜索概率,在实际运用中,应根据所限定时间的不同来对这两种算法进行选择使用。另外,从程序的复杂度上来看,模拟退火算法的程序相对较为简单,而遗传算法的程序相对较为复杂。

In order to solve the problem of target allocation in naval fleet air defense,a model is given by combining the features of modern air defense combat.Three optimum algorithms were used to solve the model by using MATLAB software.The result indicate that the Tabu search can get the overall superior solution with the rate of 100%,as it has a long and random search time,it is not fit to solve the problem of target assignment.The simulated annealing and Genetic algorithm can achieve a very high search rate in a very short time,in actual use,should choose one of them according to the limited time.Discuss from the complications of the procedure,the simulated annealing is simpler than the genetic algorithm.