摘要
随着民航运输业的快速发展,我国现有航路结构已不能满足运输需求,亟待优化调整,但由于大量“三区”的存在,使得航路优化过程较为复杂。为了实现“三区”规避下的航路优化,以航路总长度最短为优化目标,构建航路优化模型,利用IA^(*)算法进行求解。实例结果表明,利用IA^(*)算法对航路进行优化时,可获得比A^(*)算法、A^(*)PS算法更好的优化效果,与A^(*)算法和A^(*)PS算法相比,可缩短航路长度最多达19%和11%,可降低航路非直线系数最多达19%和12%,有效缩短了航路的长度,提升了航路的平整度,使得优化后的航路更具实际应用价值。
With the rapid development of civil aviation transportation industry,China′s existing route structure can no longer meet the transportation needs,and needs to be optimized and adjusted.However,due to the existence of a large number of"three zones",route optimization processis more complex.In order to realize the route optimization under the"three zone"avoidance,the route optimization model is constructed with the shortest total route length as the optimization objective,and the IA^(*)(Improved A^(*),IA^(*))algorithm is used to solve it.The example results show that when using the IA^(*)algorithm to optimize the route,it can obtain better optimization results than the traditional A^(*)algorithm and A^(*)PS algorithm.Compared with the A^(*)algorithm and A^(*)PS algorithm,it can shorten the route length by up to 19%and 11%,and reduce the non-linear coefficient of the route by up to 19%and 12%.It can effectively shorten the route length,improve the flatness of the route,and make the optimized route more practical application value.
作者
李超
田勇
牛科新
孙梦圆
刘祥彬
LI Chao;TIAN Yong;NIU Ke-xin;SUN Meng-yuan;LIU Xiang-bin(Nanjing University of Aeronauticsand Astronautics,Nanjing 211000,China;CAAC Central and Southern Regional Administration,Guangzhou 510000,China)
出处
《航空计算技术》
2022年第6期45-49,共5页
Aeronautical Computing Technique
基金
国家自然科学基金与民航基金联合项目资助(U1933119)
南京航空航天大学创新计划项目资助(xcxjh20210708)。
关键词
“三区”规避
航路优化
IA^(*)算法
栅格寻路
"three-zone"circumvention
route optimization
improved A^(*)algorithm
grid routing