用离散粒子群优化算法求解WTA问题

曲在滨^1,2, 刘彦君², 徐晓飞¹

1.哈尔滨工业大学计算机科学与技术学院;2.哈尔滨理工大学计算机科学与技术学院



摘要:

为了提高武器-目标分配(WTA)问题的求解效率和性能,提出了一种用离散粒子群(DPSO)算法求解此问题的新方法.对粒子群算法中的速度和位置进行了重新定义,使其可求解WTA这类离散组合优化问题,并采用贪心的启发式策略对迭代产生的方案进行调整,以利于快速找到最优或次优的分配方案.算法测试表明新算法执行速度快,结果令人满意,提出的算法能快速给出WTA问题的最优或近优分配方案.

关键词:  武器-目标分配  约束优化  粒子群优化算法  遗传算法

DOI：10.11918/j.issn.0367-6234.2011.03.014

分类号:TP301.6

基金项目:



Discrete particle swarm optimization for solving WTA problem

QU Zai-bin^1,2, LIU Yan-jun², XU Xiao-fei¹

1.School of Computer Science and Technology,Harbin Institute of Technology,150001 Harbin,China;2.School of Computer Science and Technology,Harbin University of Science and Technology,150080 Harbin,China)

Abstract:

To improve the solving efficiency and performance,a new Discrete Particle Swarm Optimization(DPSO) algorithm for the problem of weapon-target assignment(WTA) was presented,in which the velocity and position in the original PSO formulas were redefined to solve a discrete combination optimization such as WTA.The greedy heuristic policies were exploited to adjust the solutions generated during the execution of the algorithm to find optimal or suboptimal solution rapidly.The experiments show that the new algorithm can get the optimal or suboptimal solution quickly,and the result is satisfying.

Key words:  Weapon-target Assignment(WTA)  constrained optimization  Particle Swarm Optimization(PSO) algorithm  Genetic Algorithm(GA)