基于文化基因算法求解动态武器目标分配
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:


Dynamic Weapon Target Assignment Based on Cultural Gene Algorithm
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对动态武器目标分配(dynamic weapon target assignment,DWTA)问题,提出一种基于进化算法和局部 搜索算法的文化基因算法(memetic algorithm,MA)。以最大化目标毁伤为目标,建立考虑能力约束、策略约束、资 源约束、拦截可行性约束条件下的DWTA 模型;引入虚拟排列进行编码以满足拦截可行性要求,设计将排列转化为 实际分配方案的构造方法,给出算法运行过程中对随机事件的处理方法。通过与遗传算法(genetic algorithm,GA)、 MA-GLS(memetic algorithm global local search)求解不同测试实例的对比仿真,结果表明,MA 算法具有寻优速度快、 优化能力强、稳定性好的优点。

    Abstract:

    For the dynamic weapon target assignment (DWTA) problem, a memetic algorithm (MA) based on evolutionary algorithm and local search algorithm is proposed. In order to maximize the target damage, the DWTA model considering the constraints of capacity, strategy, resource and interception feasibility was established. A virtual permutation was introduced to encode the DWTA model to meet the requirement of interception feasibility, and the construction method of transforming the permutation into the actual allocation scheme was designed, and the method of dealing with random events in the operation process of the algorithm was given. Compared with genetic algorithm (GA) and memetic algorithm global local search (MA-GLS) in solving different test cases, the simulation results show that MA algorithm has the advantages of fast optimization speed, strong optimization ability and good stability.

    参考文献
    相似文献
    引证文献
引用本文

强裕功.基于文化基因算法求解动态武器目标分配[J].,2024,43(04).

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-12-20
  • 最后修改日期:2024-01-23
  • 录用日期:
  • 在线发布日期: 2024-05-16
  • 出版日期: