基于图论和遗传算法的终端扇区划分方法

为了均衡终端区扇区的工作负荷,保障扇区边界的合理性,研究了终端扇区的划分方法.针对建立的扇区划分数学模型,提出了3阶段的划分方法.首先,采用voronoi图和遗传算法完成初始划分,实现均衡负荷的目标;其次,提出了基于voronoi图和基于maklink图的2种扇区二次划分方法,满足最小飞行时间及最小距离约束;最后,应用分段线性拟合的方法消除扇区边界的锯齿状,以及满足扇区凸形约束.以广州终端为例进行了仿真计算.应用提出的方法,给出了2种划分结果,都能够使得各扇区的工作负荷在2880s以内,差值不超过350s,扇区边界较为平滑,且计算时间明显减少.仿真计算结果说明方法是可行和有效的,也为使用者提供了灵活的选择.

Terminal Airspace Sectorization Method Based on Graph Theory and GA Algorithm

In order to balance the workload of terminal sector and ensure sector boundary reasonability,a terminal airspace sectorization method was researched.Aiming at sectorization mathematical model,three-stage methods was proposed.In the first stage,voronoi graph and genetic algorithm were used to initial sector plan and balanced workload.In the second stage,two method were applied to satisfy the constrains of minimum flight time and the minimum distance.In the last stage,piecewise linear fitting method was used to eliminate jagged sector boundary,as well as satisfy the sector convex constraint.Take the guangzhou terminal airspace as an example.By using the method in this paper,two results were presented.In both results,each sector workload was below 2880 s,and the difference did not exceed 350 s,meanwhile,sector boundaries were smooth and computing time was significantly reduced.The simulation results indicate that the method in this paper is feasible and effective,and also provides the user with flexible options.