Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm 被引量：9

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

下载PDF

导出

摘要 Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing 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 creating agrid environment.And finally the objective 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%. Air route network （ARN） planning is an efficient way to alleviate civil aviation flight delays caused by increasing 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 bythree area, also known as prohibited areas, restricted areas, and dangerous areas （PRDs） , by creating a grid environment. And finally the objective function was solved by means of an adaptive ant colony algorithm （A AC A）. 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%.

作者 Wang Shijin Li Qingyun Cao Xi Li Haiyun

机构地区 College of Civil Aviation

出处《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2016年第4期469-478,共10页 南京航空航天大学学报（英文版）

基金 supported by the the Youth Science and Technology Innovation Fund (Science)(Nos.NS2014070, NS2014070)

关键词 air route network planning three area avoidance optimization of air route network node adaptive ant colony algorithm grid environment air route network planning three area avoidance optimization of air route network node adaptive ant colony algorithm grid environment

分类号 U8 [交通运输工程]

引文网络
相关文献

参考文献18

1V U D , G ILLES G , N IC O LA O N J , et al. SectorLessair traffic m anagem ent [C] //A ir Traffic M anagement R & D Sem inar. Santa F e : A IA A , 2001: 17.
2T H O M A S R , PA SCA L B. S hortest path in planargraph and air route netw ork [C]/ / Proceedings of the4th Eurocontrol Innovative R esearch W orkshop &Exhibition. France : E urocontrol, 2005 : 1-10.
3Z H O U J. R esearch of the airspace en route netw orkbased on the bi-level program m ing [D] . N anjing:Nanjing U niversity of A eronautics and A stronautics,2008. (in Chinese).
4CAI K Q , Z H O U C. O ptim ization of the crossingw aypoints in air route netw ork [C]//D ig ita l AvionicsSystem s Conference (D A S C ). U S A : IE E E , 2010:2. E. 3-1-2. E. 3-8.
5X IAO M M , ZH A N G J , CAI K Q , et al. C ooperativeco-evolution w ith w eighted random grouping forlarge-scale crossing w aypoints locating in air routenetw ork [C]//T o o ls w ith A rtificial Intelligence (IC -T A I). U S A : IE E E , 2011: 215-222.
6XIN Zhengwei. R esearch on air route netw ork planningtechnology [D]. N anjing: Nanjing U niversity ofA eronautics and A stro nautics,2013. (in Chinese).
7C H EN Cailong. R esearch on optim ization m ethod based on com plex netw ork for crossing w aypoints location[D]. H efei : U niversity of Science and T echnologyof C hina, 2011. (in Chinese).
8ZH A O Shuang. R esearch on national trunk air routenetw ork design [D]. B eijing: Beijing U niversity ofA eronautics and A stro nautics,2008. (in Chinese).
9W A N G S J , G O N G Y H. R esearch on air route network nodes optim ization w ith avoiding the three areas[J]. Safety Science- 2014, 6 6 : 9-18.
10G U O H T , Z H U Q B, XU S J. Rapid-exploring randomtree algorithm for path planning of robot basedon grid m ethod [J]. Journal of Nanjing N orm al U niversity( Engineering and Technology E d itio n ) ,2007, 7(2) : 58-61.

二级参考文献11

1孟庆春,贾培发.关于Genetic算法的研究及应用现状[J].清华大学学报（自然科学版）,1995,35(5):44-48. 被引量：21
2丁承民,张传生,刘辉.遗传算法纵横谈[J].信息与控制,1997,26(1):40-47. 被引量：92
3Goldberg DE. Geneic algorithms in search, optimization and machine learning.Addison wesley publishing companny,Inc,1989.
4Dorigo M,Gambardella L M,Middendorf M,et al. Guest editorial: special section on ant colony optimization[A]. IEEE Transactions on Evolutionary Computation[C]. 2002,6(4): 317-319.
5Dorigo M,Dicaro G. Ant colony optimization: a new meta-heuristic[A]. Proceedings of the 1999 Congress on Evolutionary Computation[C]. Washington,DC,USA: 1999,Vol.2. 1477. 474-477.
6Wang C M,Soh Y C,Wang H,et al. A hierarchical genetic algorithm for path planning in a static environment with obstacles[A]. IEEE CCECE Canadian Conference on Electrical and Computer Engineering[C]. 2002,vol.3.1652-1657.
7D'Amico A,Ippoliti G,Longhi S A. Radial basis function networks approach for the tracking problem of mobile robots[A]. Proceedings of the IEEE/ASME. International Conference on Advanced Intelligent Mechatronics[C]. 2001,vol.1. 498-503.
8Weerayuth N,Chaiyaratana N.Closed-loop time-optimal path planning using a multi-objective diversity control oriented genetic algorithm[A]. Systems,Man and Cybernetics[C]. IEEE International Conference on,Vol.6:7.
9Bruce J,Veloso M. Real-time randomized path planning for robot navigation[A]. Intelligent Robots and Systems 2002. IEEE/RSJ International Conference on,2002,Vol.3. 2383- 2388.
10Dorigo M,Maniezzo V,Colorni A. Ant system: optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems ,Man and Cybernetics,Part B: Cybernetics,1996,26(1): 29-41.