一种有限空间区域的机群调度优化算法

 基于有限空间区域调度优化问题，针对机群调度具体问题，先将机群保障流程整体抽象建模，再把物理模型转化为典型调度问题模型，设计启发式规则提出优化算法。算法分为上、下两层次，上层负责在有限区域内选择合适的停机位和起飞位，下层负责对单机各作业进行调度，下层把调度结果返回给上层算法，上层根据该调度结果自适应调节某架机的停机位和起飞位，重新调用下层算法以验证该调整是否能改善解的质量。以典型出动任务作为输入算例，求解出有限空间区域的机群调度方案结果。相比之前人工排布的方式，本方法在求解时间和结果优劣两方面更具优越性，该方法使得机群调度指挥方式向智能自动化过渡，对提升机群出动架次率有重要意义。

Algorithm for aircraft cluster scheduling in limited space area

For the aircraft cluster scheduling problem in a limited space, the paper models the overall operation process first, then converts the model to a typical scheduling model, for which heuristic rules and an optimization algorithm are presented. The algorithm is divided into upper and lower levels. The upper layer is responsible for selecting parking space and take-off position in the limited area. The lower layer is responsible for the scheduling work of each single aircraft and returns the scheduling result to the upper layer, which adaptively adjusts the result accordingly. Then, the lower layer algorithm is recalled to verify whether the adjustments of stand and takeoff position can improve the quality of the solution. The result of the scheduling scheme is demonstrated. Compared withmanual arrangement, the method is more advantageous in both solving-time and solution quality. This method is of great significance to improve the efficiency of aircraft sorties.