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

考虑任务可达约束的突击作战任务分配方法
引用本文:张磊,姚佩阳,徐雪洁,周义建.考虑任务可达约束的突击作战任务分配方法[J].计算机工程,2012,38(24):239-243.
作者姓名:张磊  姚佩阳  徐雪洁  周义建
作者单位:1. 空军工程大学信息与导航学院,西安,710077
2. 中国人民解放军95801部队,北京,100085
基金项目:国家自然科学基金资助项目
摘    要:在实际突击作战中,航空作战平台进行任务分配时存在任务可达约束的特点。为此,建立任务可达约束条件下突击作战任务分配问题的数学模型。采用遗传算法对该问题模型进行求解,并设计与之相适应的染色体编码方法、随机双点定位的交叉算子和一致性单点调整的变异算子。案例仿真结果表明,该方法能够有效解决任务可达约束条件下的任务分配问题,具有较好的稳定性和时效性。

关 键 词:航空作战平台  突击作战  任务分配  任务可达约束  组合优化
收稿时间:2012-06-29
修稿时间:2012-08-24

Strike Combat Task Allocation Method Considering Task Executable Restriction
ZHANG Lei , YAO Pei-yang , XU Xue-jie , ZHOU Yi-jian.Strike Combat Task Allocation Method Considering Task Executable Restriction[J].Computer Engineering,2012,38(24):239-243.
Authors:ZHANG Lei  YAO Pei-yang  XU Xue-jie  ZHOU Yi-jian
Affiliation:1(1.Information and Navigation Institute,Air Force Engineering University,Xi’an 710077,China;2.No.95801 Unit of PLA,Beijing 100085,China)
Abstract:Aiming at the problem that strike combat task allocation exists task executable restriction, the mathematics model is established. The Genetic Algorithm(GA) is used to solve the model. In order to suit the model characteristic, the coding way of chromosomes is designed. At the same time, a process of arithmetic cross is designed in which double bit is random fixed, the mutation process is designed by means of the consistency single bit redressal. Experimental results of case show that the algorithm solves the problem model available under task executable restriction, the dependability and time effectiveness of this approach are illuminated.
Keywords:Aerial Combat Platform(ACP)  strike combat  task allocation  task executable restriction  combination optimization
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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