舰载机出动离场调度优化算法

出动离场调度是舰载机起降作业中关键一环, 可抽象为NP(non-deterministic pdynoial)难问题的混合车间调度问题。首先，在传统数学规划模型基础上, 引入逻辑约束及间隔变量, 建立了约束规划模型。然后，通过调度分解技术构建多机调度转化为单机调度的启发式规则, 并提出了单机约束引导启发式搜索与约束规划二分法迭代算法, 给出了问题的求解流程。算例仿真表明, 约束规划可有效解决不同规模下的离场调度, 并快速收敛到阈值内; 在中小规模出动时, 所提算法效率比传统智能方法提升约2个数量级, 具有较强实时规划能力, 但随着实验规模增大算法收敛时间呈线性变化趋势, 而在本文研究范围内仍优于传统智能算法, 具有良好实用价值。最后，用起飞位数量对出动效率进行灵敏度分析, 发现C2起飞位对出动效能贡献最大。

Optimization algorithm of carrier-based aircraft sortie departure scheduling

Sortie departure scheduling is a key part of the take-off and landing operations of carrier-based aircraft, which can be abstracted as an non-deterministic polynomial(NP)-hard hybrid job-shop scheduling problem. Firstly, based on the traditional mathematical programming model, logical constraints and interval variables are introduced to establish a constraint programming model. Then, the heuristic rules for transforming multi-machine scheduling into single-machine scheduling are constructed through scheduling decomposition technology, and the single-machine constraint-guided heuristic search and constraint programming dichotomy iterative algorithm is proposed. The simulation results show that the constrained programming could effectively solve the problem of departure scheduling under different scales and converge to the threshold quickly. The efficiency of the proposed algorithm in small and medium scale is about two orders of magnitude higher than that of the traditional intelligent method, and it has strong real-time planning capabilities. However, as the scale increases, the convergence time changes linearly, and it is still better than traditional methods in the scope of this article. Finally, the sensitivity analysis of the sortie efficiency based on the number of available take-off positions shows that the C2 take-off position contributes the most to the dispatch efficiency.