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

求解面向进攻的武器-目标分配问题的蚁群算法
引用本文:陈伟,陈杰,辛斌.求解面向进攻的武器-目标分配问题的蚁群算法[J].火力与指挥控制,2012,37(4):37-41.
作者姓名:陈伟  陈杰  辛斌
作者单位:北京理工大学自动化学院,北京 100081;复杂系统智能控制与决策教育部重点实验室,北京 100081
基金项目:国家杰出青年科学基金,省部级重点基金资助项目
摘    要:面向进攻的武器-目标分配问题是军事运筹学研究中的重要课题,旨在制定合理的打击策略以最大程度摧毁敌方目标。采用一种融合局部搜索和信息素控制的蚁群算法,兼顾控制解的局部收敛速度和全局收敛质量。在解的构造过程中直接处理约束条件,提高生成解的可行性,并大大缩小了搜索空间,提高了算法效率。通过采用多种算法对不同规模的武器-目标分配问题进行实验,结果表明改进的蚁群算法在收敛速度和求解质量上表现优异。

关 键 词:武器-目标分配  蚁群算法  局部搜索  信息素控制机制

Solving Attack-oriented Weapon-target Assignment Problem by Ant Colony Algorithm
CHEN Wei , CHEN Jie , XIN Bin.Solving Attack-oriented Weapon-target Assignment Problem by Ant Colony Algorithm[J].Fire Control & Command Control,2012,37(4):37-41.
Authors:CHEN Wei  CHEN Jie  XIN Bin
Institution:1,2) (1.School of Automation,Beijing Institute of Technology,Beijing 100081.China, 2.Key Laboratory of Complex System Intelligent Control and Decision,Ministry of Education,Beijing 100081,China)
Abstract:The attack-oriented Weapon-Target Assignment(WTA) problem is an important subject in military operations research.The object of WTA is to obtain desirable engagement plans to maximize the damage of hostile targets.In this paper,we present an improved ant colony algorithm,incorporating local search and pheromone control mechanism,to accelerate local search and improve the quality of global convergence.We achieve constraint handling directly in the process of constructing WTA solutions,which enhances the feasibility of generated solutions and largely reduces search space.We applied different algorithms to various scales of WTA problems,and the results demonstrate that the improved ant colony algorithm has outstanding performance.
Keywords:weapon-target assignment  ant colony algorithm  local search  pheromone control mechanism
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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