Optimization of Air Route Network Nodes to Avoid″Three Areas″Based on An Adaptive Ant Colony Algorithm

摘要

Air route network (ARN)planning is an efficient way to alleviate civil aviation flight delays caused by in-creasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node (ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas (PRDs),by crea-ting a grid environment.And finally the obj ective function was solved by means of an adaptive ant colony algorithm (AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns, a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs. The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.