Research On Taxiing Optimal Dispatch Of Massive Airport Surface

As the fast increasing of air traffic flow,the pressure of the operation of airports becomes larger. The main reason of the flight delay is from surface operation,causing the rising operating costs and the surface security issues at the same time. That is partly because, surface surveillance and guidance are lag in equipment and technology, but also because surface layout is not rational enough and existing limitations. The purpose of this paper is to present a fast and effective optimal dispatch method based on surface operation characteristics of massive airport.First of all,this paper introduces the main research methods and findings on taxiing route planning, then research purpose is determined. Second, this paper describes a kind of hierarchical network model. Louvain algorithm is used to partition graph which can gets community structure and hierarchy from network at the same time. Considering specific characteristics of airport surface network and operation rules, a method for correcting hierarchical network based on actual maximum betweenness is proposed. Third, this paper sets up a dynamic route planning algorithm, which is optimized by modifying its MODIFY-COST function with considering detection and solution for taxiing conflicts,then this algorithm is used on hierarchical network. At the last chapter, analyzing and designing on simulation system of airport surface operation are finished. Three simulation experiments are finished to verify the ability to resolve conflicts,the validity of the simulation system and the optimality and complexity of algorithm. Final results indicated the surface operation can be reflect by this simulation system, the dynamic route planning algorithm has the abilities to resolve conflicts and reduce taxiing time.