Research On Carrier Aircraft Deck Support Scheduling Algorithm

As an important weapon in modern war,aircraft carrier is an important way for navy to fight for sea power and air power.Among them,as the carrier's main combat force,the optimization of its support scheduling process is particularly important.At present,a kind of " Ouija Board " method is mainly used in the deck scheduling.However,due to the limited space on the deck,the complex physical structure of the deck,and many interference constraints,it is impossible to make the carrier aircraft fly in a short period of time to form combat effectiveness only relying on manual scheduling.Therefore,It is necessary to optimize the process of deck support scheduling.First of all,this paper introduces the scheduling process and resources of the deck.Based on the batch dispatch mode,the complexity of solution in the landing recovery stage,selection stage,support operation stage and take-off operation stage of carrier aircraft is proposed.Aiming at the time constraints,space constraints and resource constraints in the process of aircraft fleet support scheduling,the optimization model is established,and the objective function is proposed to minimize the time of support operations and take-off operations in a single batch.Then,aiming at the problem of choosing the take-off position in the take-off operation stage,this paper adopts the greedy strategy as the main solution to choose the appropriate take-off position for the completed carrier aircraft.For the problem that carrier aircraft need to select gate for support operation,this paper presents various heuristic priority rules in the process of carrier aircraft support scheduling;In order to measure the value of the gate more quantitatively,the scoring function of the gate is introduced to score the gate according to the distribution of available resources around the gate;based on the above two points,the take-off position allocation algorithm is proposed.In the stage of carrier aircraft support operation,the process of support operation is abstracted into a hybrid job shop scheduling problem.Aiming at the problem of reasonable arrangement of support process,this paper uses an improved genetic algorithm,and optimizes the support process by using adaptive crossover operator and mutation operator.Finally,several different missions are used as experimental examples to test the algorithm,and the support operation time under different missions are obtained.Compared with the simple genetic algorithm and the " Ouija Board " method,it can be seen that the algorithm can not only increase the parallelism between support processes,but also greatly shorten the support operations time,which proves the effectiveness of the algorithm.