首页 | 本学科首页   官方微博 | 高级检索  
     检索      

武器-目标分配问题的粒子群优化算法
引用本文:高尚,杨静宇.武器-目标分配问题的粒子群优化算法[J].系统工程与电子技术,2005,27(7):1250-1252.
作者姓名:高尚  杨静宇
作者单位:1. 江苏科技大学电子信息学院,江苏,镇江,212003;南京理工大学计算机科学与技术系,江苏,南京,210094
2. 南京理工大学计算机科学与技术系,江苏,南京,210094
摘    要:建立了武器-目标分配问题的优化模型,分析了各种解决此模型的方法的优缺点。经典的粒子群是一个有效的寻找连续函数极值的方法,结合遗传算法的思想提出粒子群算法来解决武器-目标分配问题。经过比较测试,4种粒子群算法的效果都比较好,特别交叉策略A和变异策略B的混合粒子群算法是最好的且简单有效的算法。

关 键 词:粒子群  武器-目标问题  优化
文章编号:1001-506X(2005)07-1250-04
修稿时间:2004年7月8日

Solving weapon-target assignment problem by particle swarm optimization algorithm
GAO Shang,YANG Jing-yu.Solving weapon-target assignment problem by particle swarm optimization algorithm[J].System Engineering and Electronics,2005,27(7):1250-1252.
Authors:GAO Shang  YANG Jing-yu
Institution:GAO Shang1,2,YANG Jing-yu2
Abstract:An optimization model of weapon-target assignment problem (WTA) is given. Many optimization methods to solve the optimum model and their advantages and shortages are analyzed. The classical particle swarm op- timization is a powerful method to find the minimum of a numerical function on a continuous definition domain. The particle swarm optimization algorithm combining the ideal of the genetic algorithm is recommended to solve the weapon-target assignment problem. All the four particle swarm optimization algorithms are proved effective. Especially the particle swarm optimization algorithm with across strategy A and mutation strategy B is a simple and effective bet- ter algorithm than others.
Keywords:particle swarm  weapon-target assignment problem  optimization
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号