Research On Multiple Runway Flight Schedule Based On Improved Shuffled Frog Leaping Algorithm

With the development of economy, air transport industry is unprecedented prosperity,air traffic flow increases sharply,thus,terminal area become quite busy.Distributing the best sequence and homologous runway to each airplane can make sure flight land safety and orderly,and reduce congestion in the terminal. Therefore,it is inestimable to improve airport efficiency and reduce the loss of delay.Firstly,considered factors,such as,the wake interval,cable spacing,location constraints and runway operation mode as many as possible,a single runway flight scheduling model and a model of parallel multi runway flight sequencing whose allocation and sequencing happened at the same time are established. Then, a sequencing simulation system which based on the improved Shuffled Frog Leaping Algorithm was set up. According to the problem of invalid individuals brought up by traditional shuffled frog leaping algorithm, the idea of gene translocation from partheno genetic algorithm was introduced to redesign the local search strategy,and increase the quantity of populations to conquer the disadvantage of conferencing to the local optimum of the original algorithm. Then the improved shuffled frog leaping algorithm was used to solve the model. Finally,compare the simulation results with the results of genetic algorithm and first come first serve method,which shows that improved shuffled frog leaping algorithm can be used to solve the problem of flight scheduling.