Abstract:

The deck-disposed scheduling methods of carrier planes about De Gaulle are researched based on different optimization algorithms, which can be used to solve the same questions of another aircraft carrier. First, the basic conditions of deck-disposed scheduling problem of carrier planes are analysed, which includes battle position setting, distance measurement between gate position and preparative position, natural takeoff flow analysis, takeoff time expressions about different numbers of carrier planes. Second, the deck-disposed scheduling question is changed into a multiobjective functions with restriction which needs to figure out the minimum solution, then the mathematical model is proposed. Third, the honeybee particle swarm optimization (HPSO) and genetic algorithm (GA) are used to solve the problem separately. In the end, the average shortest takeoff time, average shortest moving distance, standard deviation and the astringency and accuracy of algorithms about fifty separate operations are compared. The result shows that HPSO is fitter than GA for solving the problem.