基于基本空间组合关系的舰载机机库布列算法

Layout algorithm for carrier aircraft in hangar based on basic spatial combination relationship

  • 摘要:
      目的  提出一种优化航空母舰机库甲板舰载机布列的算法。
      方法  针对机库内舰载机混搭布列问题,基于基本空间组合关系,建立组合关系库,优化解空间,将有约束的二维排样问题转换为组合优化问题。然后,再以最大舰载机数量与最大可紧急出动舰载机数量为目标,建立机库布列模型,并利用一种启发式算法求解该模型。
      结果  以“尼米兹”级航空母舰作为案例进行求解,得到的机位排布方案能够在保证紧急出动舰载机数量的情况下最大化机库布列总数量,且布列方案满足实际业务约束与需求;与美军布列方案相比,机库甲板的面积利用率提高了16.92%。
      结论  使用该算法可以有效地对舰载机机库布列问题进行求解。

     

    Abstract:
      Objectives  This paper proposes an algorithm for optimizing the layout of carrier aircraft in a hangar.
      Methods  To solve the problem of the mixed layout of aircraft in a hangar, based on the basic spatial combination relationship, this paper sets up a combinatorial relationship library, optimizes the solution space and converts the constrained two-dimensional layout problem into a combinatorial optimization problem. A hangar layout model is established with the maximum number of carrier aircraft and maximum number of emergency dispatch aircraft, and a heuristic algorithm is used to solve the model.
      Results  Using the case study of a USS Nimitz-class aircraft carrier, the resulting layout scheme can maximize the total number of carrier aircraft while ensuring the number of emergency dispatch aircraft, and the results satisfy actual business constraints and requirements. Compared with the layout scheme of USS aircraft carrier, the area utilization rate of hangar deck is increased by 16.92%.
      Conclusions   The proposed algorithm can be used to effectively solve the layout problem of carrier aircraft in a hangar.

     

/

返回文章
返回