Dynamic reconfiguration for en-route airspace

As the air traffic demand is anticipated to be increased significantly in the near future,dynamic and effective allocation of the airspace resource is becoming a world-wide focus in the research field of air traffic management（ATM）.Taking the U.S.targeting the en-route airsapce,a dynamic airspace configuration（DAC） algorithm to reconfigure the airspace in consideration of higher efficiency and safety is presented.First,a modeling technique based on graph theory is proposed to generate a mathematical model for the airspace,and then,the graph model is partitioned into subgraphs for the purpose of sectorizatoin.The final step generates sector configuration with desirable geometry shape.Through analysis on the Cleveland airspace center（ZOB） in the U.S.,the algorithm is proved to be robust to time-varying traffic load.

Dynamic airspace configuration method based on a weighted graph model

This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.

Dynamic airspace configuration by genetic algorithm

With the continuous air traffic growth and limits of resources, there is a need for reducing the congestion of the airspace systems. Nowadays, several projects are launched, aimed at modernizing the global air transportation system and air traffic management. In recent years, special interest has been paid to the solution of the dynamic airspace configuration problem. Airspace sector configurations need to be dynamically adjusted to provide maximum efficiency and flexibility in response to changing weather and traffic conditions. The main objective of this work is to automatically adapt the airspace configurations ac- cording to the evolution of traffic. In order to reach this objective, the airspace is considered to be divided into predefined 3D airspace blocks which have to be grouped or ungrouped depending on the traffic situation. The airspace structure is represented as a graph and each airspace configuration is created using a graph partitioning technique. We optimize airspace configurations using a genetic algorithm. The developed algorithm generates a sequence of sector configurations for one day of operation with the minimized controller workload. The overall methodology is implemented and successfully tested with air traffic data taken for one day and for several different airspace control areas of Europe.

基于管型空域配置的交通复杂性管理

空域的动态配置能力将为空中交通管理提供异质的空域框架,主动适应空中交通增长的复杂特性。管型空域是在繁忙区域中建立的低交通阻抗通道,是实现空域动态配置能力的重要途径和主要研究方向。就转变的空域/交通适应性关系分析了配置管型空域的必要性,分别建立了基本型管型空域模型与增强型管型空域模型。采用基于连携性的交通复杂性测度指标作为空域性能的评价基础,相比无约束的运行空域,管型空域可在维持相同流量的条件下显著降低空中交通的复杂性。针对两类管型空域模型,讨论了基于流调配的交通复杂性管理策略。多向管型空域中各单向管型空域的交通特征显著分化,因此,相应的交通复杂性管理策略须建立在对各管运行情况细致分析的基础上,才能实现交通吞吐量与其复杂性间的最佳权衡。

基于动态扇区的空域与飞行流量两阶段协同规划模型及算法

针对管制扇区动态规划与飞行流量时空调配的耦合问题,考虑运行容量、效率等目标,建立了两阶段协同规划模型及求解框架。第一阶段根据自然航路点和流量分布,结合Voronoi图与图论模型构建有限元加权图拓扑抽象,以均衡管制负荷和减少协调移交负荷为目标,基于遗传算法适应性生成扇区结构;第二阶段综合等待和改航策略,以缓解区域总延误和该区域造成的区域外延误为目标,同时兼顾均摊延误和减少延误架次,在区域内容量约束和其他区域对该区域的流控约束下,基于NSGAII进行流量时空优化。按照优先级顺序实施策略流程,为缓解空中交通拥堵探索综合施策框架。仿真结果表明,所提出的模型算法可为提升空管运行品质提供辅助决策支持。

基于动态空域管理的安全性研究

当前静态的空域结构已很难适应不断变化的流量对空域的使用需求,动态空域管理概念为解决这一问题提供了一个可行的解决方案。扇区结构优化调整作为动态空域管理的核心内容在解决空域资源使用紧张问题的同时,也给当前管制工作安全带来了挑战。主要从管制员工作负荷、空域结构调整可能带来的管制操作困难及空域划分触发机制3个方面来探讨研究动态空域管理相关安全性问题。

基于动态空域配置的航路调整问题研究

动态空域配置旨在通过对各类型空域功能块的设计、构架、配置和使用,实现空域的动态配置功能,使管制空域灵活地匹配空中交通实际变化的需求。在此概念下建立了以最小运营成本为目标的航路调整规划模型,在模型中考虑某些航路段可以动态地开关-闭合,引入动态航路的开放成本和使用成本,以最短开放时间、最大管制负荷和航路复杂度、安全性为约束条件,采取改进的遗传算法进行求解,验证了模型的正确性和可行性。计算结果表明:用模型制定的优化策略,充分利用了空域资源,减少了延误损失,总的航班运营成本减少了15%。