Research Of The Generation Algorithm And Application Of Terminal Arrival And Departure Route Network

The arrival and departure route network can help to reduce the complexity of the terminal airspace operation and advantages the improvement of flight safety, economy and efficiency. To improve the efficiency and automation of route network generation algorithm,and to get a practical result of the route network in terminal airspace, the route network generation algorithm is investigated.The converging characteristics of arrival routes and the diverging characteristics of departure routes are analyzed first. Based on these analyses, three principles of route design are proposed. A two-step methodology of generation of arrival and departure route network are proposed. Firstly, the arrival and departure fixes are located. Secondly, the arrival and departure routes are generated.To locate the arrival and departure fixes, two sets of flow demand points and alternate fixes are modeled based on the theory of the location problem of discrete facilities. The calculation of flow demand points is modeled based on the arrival flights queuing theory. The total distance between fixes and points and site safety are taken as the goals and the flow matching between fixes and points and the intervals among fixes as the constraints in multi-objective programming model. The optimal result is searched by immune algorithm.For arrival and departure routes generation, route network model and design are carried out from the perspective of network topology structure. Firstly, a programming model is established whose optimization objectives are terminal capacity, route length and route gradient, meeting the constraints of obstacle height, restricted area avoidance, vertical separation between arrival and departure routes over cross point and the interval between merge points. Secondly, terminal MAKLINK graph is constructed based on restricted area convex polygon, on which an initial route is achieved passing the midpoint on MAKLINK lines using Dijkstra algorithm. Finally, ant colony algorithm is conducted to find optimal waypoints horizontally and gradient vertically at the same time. Meanwhile, the optimal merge point is gained.Taking the XIANYang airport 05 L runway configuration in XI’AN terminal area as anexample to test both the model and the algorithm proposed above on MATLAB. The simulation results show that the combination and location layout of arrival and departure fixes match the actual terminal area and the selecting process can determine absolute positions of fixes and relative positions between fixes automatically. For another, optimized arrival and departure route network whose merge points are rational in location and separation conforms to constraints under good objective value. Both the immune algorithm and the ant colony algorithm work well and have a rapid convergence.