摘要
提出一种新的求解静态武器目标分配问题的离散差分进化算法.采用整数排列建立武器–目标分配对,作为离散差分进化算法的初始个体;并通过取模运算对溢出取值范围的解向量进行修正,将其转化到解的搜索区域内,从而对差分变异算子进行设计.同时,提出相应的交叉策略,得到可行的武器目标分配对.在交叉过程中,保留目标向量与试验向量中相同的分配对,得以很好地利用上一代的分配结果.在删除重复数和重新插入整数时,为了避免倾向性,生成随机排列,保证对数据处理的公平性.实验结果表明,提出的离散差分进化算法在收敛性和求解质量方面均优于另外2种典型的离散差分进化算法,很好地实现了武器目标分配问题的有效求解.
A new discrete differential evolution algorithm was proposed to solve the static weapon target assignment （SWTA） problem. Firstly, the integer permutation was applied to building weapon-target assignment pair. Then, the differential mutation was designed by means of the modular operator to restrict the bound offending solutions into the search space. At the same time, the corresponding crossover strategy was presented to acquire the feasible solutions. In the process of crossover, the same assignment pairs of the objective and trial vectors were reserved for utilizing the results of the previous generation. In order to avoid the bias, a random permutation was generated to assure the fairness in the process of deleting repeat integers and reinserting new integers. The experimental results demonstrate that the new DDE is superior to the other two typical DDEs in terms of convergence property and solution quality and solves the static weapon target assignment problem.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2014年第3期289-293,321,共6页
Transactions of Beijing Institute of Technology
基金
国家杰出青年科学基金资助项目(60925011)
国家自然科学基金委国际(地区)合作项目(61120106010)
山西省青年科技研究基金资助项目(2012021012-4)
太原科技大学校青年基金资助项目(20113003)
关键词
离散差分进化算法
差分变异
交叉
武器目标分配
discrete differential evolution algorithm
differential mutation
crossover
weapontarget assignment
