| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
