基于IABC算法的舰载机着舰调度
作者:
作者单位:

1.海军航空大学航空基础学院;2.海军航空大学作战勤务学院

作者简介:

通讯作者:

中图分类号:

V355.2

基金项目:


Scheduling of Landing for Carrier-based Aircraft Based on Improved Artificial Bee Colony Algorithm
Author:
Affiliation:

Naval Aviation University

Fund Project:

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

    舰载机有序、高效着舰是确保舰载机舰面保障计划如期进行的必要前提,为提高舰载机着舰效率并减轻传统人工着舰排序的负担,研究了一种舰载机着舰调度算法。首先,以加权着舰完成时间和为优化目标,构建舰载机着舰调度的数学模型。其次,提出一种改进的人工蜂群算法用于模型求解。算法在基本人工蜂群算法额基础上引入遗传算法中的交叉算子、精英策略以及一系列自适应局部搜索策略,以增强算法的全局搜索性能,提高算法收敛速度。最后,通过着舰调度案例仿真和算法对比,表明改进的人工蜂群算法具备更强的优化性能和更好的鲁棒性,可以求解大规模舰载机着舰调度问题,具有工程实际应用价值。

    Abstract:

    The orderly and efficient landing of carrier based aircraft is a necessary prerequisite to ensure that the deck operation support plan is carried out as scheduled. In order to improve the landing efficiency of carrier-based aircraft and reduce the burden of traditional manual landing scheduling, a landing scheduling algorithm for carrier aircraft is studied. Firstly, the mathematical model of landing scheduling for carrier-based aircraft is constructed with the weighted landing time sum as the optimization objective. Secondly, an improved artificial bee colony algorithm is proposed to solve the model. Based on the basic artificial bee colony algorithm, crossover operation, elite strategy and a series of adaptive local search strategies are introduced to enhance the global search performance of the algorithm and improve the convergence speed of the algorithm. Finally, the effectiveness of the proposed scheduling model is verified by the case study and algorithm comparison. It shows that the improved artificial bee colony algorithm has stronger optimization performance and better robustness, and can solve the large-scale carrier aircraft landing scheduling problem, having practical engineering application value.

    参考文献
    相似文献
    引证文献
引用本文
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2020-12-17
  • 最后修改日期:2021-04-18
  • 录用日期:2021-04-21
  • 在线发布日期: 2021-05-15
  • 出版日期: