恶劣天气条件下航路网络修复优化

针对恶劣天气条件下可用空域资源不足导致的航班大面积延误问题,基于复杂网络修复理论和交通流分配理论,借鉴交通网络设计思想提出了一种航路网络修复优化策略。首先,建立了航路网络修复场景,基于气象信息生成了恶劣天气飞行受限区。然后,建立了上层模型以修复成本最低为目标函数、下层模型为多约束交通流分配模型的双层规划修复模型,应用改进粒子群算法对模型整体进行求解,结合K最短路径算法对下层模型进行求解。最后,提出局部和全局两类指标对航路网络修复效果进行评估。基于典型航路网络,以两类基础修复策略为对比方法,同时对比了实际运行结果,研究了不同修复策略的修复效果和适用性。仿真结果表明：航路网络修复优化策略既能弥补原有拓扑结构修复策略的结构受限不足,又能解决拓扑结构调整修复策略带来的巨额协调费用问题,能够保证在对正常运行航班干扰最小的同时,以最小的修复成本使所有受影响的航班都恢复正常运行,对于减缓航路拥堵和航班延误有极大的意义。     

A strategic flight conflict avoidance approach based on a memetic algorithm

Conflict avoidance （CA） plays a crucial role in guaranteeing the airspace safety. The cur- rent approaches, mostly focusing on a short-term situation which eliminates conflicts via local adjust- ment, cannot provide a global solution. Recently, long-term conflict avoidance approaches, which are proposed to provide solutions via strategically planning traffic flow from a global view, have attracted more attentions. With consideration of the situation in China, there are thousands of flights per day and the air route network is large and complex, which makes the long-term problem to be a large-scale combinatorial optimization problem with complex constraints. To minimize the risk of premature convergence being faced by current approaches and obtain higher quality solutions, in this work, we present an effective strategic framework based on a memetic algorithm （MA）, which can markedly improve search capability via a combination of population-based global search and local improve- ments made by individuals. In addition, a specially designed local search operator and an adaptive local search frequency strategy are proposed to improve the solution quality. Furthermore, a fast genetic algorithm （GA） is presented as the global optimization method. Empirical studies using real traffic data of the Chinese air route network and daily flight plans show that our approach outper- formed the existing approaches including the GA .based approach and the cooperative coevolution based approach as well as some well-known memetic algorithm based approaches.     

航路网络生成及优化

空中交通流运行的安全性和成本取决于航路网络结构。基于节点度实现航路网络枢纽节点和干线节点分层,利用全局耦合生成主干网络,运用距离连接概率实现干线节点社区化,采用连接概率生成社区网络;采用DBSCAN聚类算法,基于角度和距离实现航路网络优化;以中国大陆空域为例,实现了主干航路网络和局部干线航路网络的生成及优化,验证了方法的可行性。在与相关研究对比,基于节点度的枢纽节点选取更加客观合理,所构建的分层航路网络结构符合机场点的分布特性,采用DBSCAN聚类算法优化效率明显提高。     

一种新的基于位置信息的路由算法研究

 为航空移动Ad hoc网络(MANET)提出一种基于位置信息的路由算法，即位置网格路由（LBGR）算法，以此来解决节点高速移动引起的路径重建问题。算法中，数据包沿路由发现时得到的网格轨迹进行传输，每个收到数据包的中转节点根据它与相邻节点、目的节点的位置关系及网络轨迹下游的路由网格位置决定下一跳节点。由于利用了网格位置信息，LBGR算法在航空节点高速移动和拓扑变化无法事先预测的情况下，使用较少的开销就可获得稳定的路由。仿真结果表明，与GRID路由算法相比，LBGR算法在节点中高速移动时，能够有效地减少路由开销，提高网络吞吐量。     

Air route network optimization in fragmented airspace based on cellular automata

Air route network optimization,one of the essential parts of the airspace planning,is an effective way to optimize airspace resources,increase airspace capacity,and alleviate air traffic con gestion.However,little has been done on the optimization of air route network in the fragmented airspace caused by prohibited,restricted,and dangerous areas (PRDs).In this paper,an air route network optimization model is developed with the total operational cost as the objective function while airspace restriction,air route network capacity,and non-straight-line factors (NSLF) are taken as major constraints.A square grid cellular space,Moore neighbors,a fixed boundary,together with a set of rules for solving the route network optimization model are designed based on cellular automata.The empirical traffic of airports with the largest traffic volume in each of the 9 flight information regions in mainland China is collected as the origin-destination (OD) air port pair demands.Based on traffic patterns,the model generates 35 air routes which successfully avoids 144 PRDs.Compared with the current air route network structure,the number of nodes decreases by 41.67％,while the total length of flight segments and air routes drop by 32.03％ and 5.82％ respectively.The NSLF decreases by 5.82％ with changes in the total length of the air route network.More importantly,the total operational cost of the whole network decreases by 6.22％.The computational results show the potential benefits of the model and the advantage of the algorithm.Optimization of air route network can significantly reduce operational cost while ensuring operation safety.     

Comparison of alternative route selection strategies based on simulation optimization

Air traffic flow management (ATFM) is a collaborative process between the airspace provider and the airspace users. The result of the collaboration should be an outcome that maxi-mizes the utility of the system without excessively penalizing any of the agents. This paper develops a discrete-event simulation model which consists of aggregate departure/arrival airports, flight routes, and sectors for evaluating the alternative collaborative route selection strategy. Given the different perspectives from air traffic control center (ACC) and airlines, eight performance-metrics and five alternative route selection strategies represent the past, current and proposed air traffic flow management operations that were evaluated. The Monte Carlo method combined with the Optimal Computing Budget Allocation (OCBA) simulation optimization technique is employed to assess the performance of different strategies. A case study of the upper air routes in central and southern China shows that the proposed model can be readily implemented to simulate different kinds of air traffic flow management strategies and predict the effect of changes on the airspace sys-tem. It also shows that the proposed alternative collaborative route selection strategy is an effective way in alleviating the en-route traffic congestion.     

受限航路空域自主航迹规划与冲突管理技术

为了解决在基于航迹运行的空中交通管理自动化系统中人机意识同步的问题，以航路运行为对象，开展了面向受限空域的自主四维航迹（4DT）冲突探测与解脱（CD&R）技术研究。基于自由航线空域（FRA）环境，提出基于栅格的空域离散化处理与计算方法；在此基础上，提出受限空域自主航迹运行两阶段方法：阶段1运用可视图（VG）法和Dijkstra算法，实现了满足限制区约束的航空器期望航迹快速规划；阶段2提出航迹可达时空域模型及其图形化表达方法，并基于连续飞行动力学推导出了不同情况下的航空器位置更新模型，并采用局部冲突探测与解脱方法，以飞行距离最短为目标，实现航空器自主路径与速度联动规划，从而支撑空地、人机认知同步的无冲突四维航迹生成；最后，以中国西部典型空域为运行场景开展仿真实验，验证了所提方法的计算高效性和模型有效性，并对栅格尺寸和探测距离这2个关键参数进行了灵敏度分析。结果表明，所提方法能够支撑复杂空域高密度运行环境自主航迹运行，为推动自主空中交通系统发展提供了新思路和新方法。     

Strategic flight assignment approach based on multi-objective parallel evolution algorithm with dynamic migration interval

The continuous growth of air traffic has led to acute airspace congestion and severe delays, which threatens operation safety and cause enormous economic loss. Flight assignment is an economical and effective strategic plan to reduce the flight delay and airspace congestion by reasonably regulating the air traffic flow of China. However, it is a large-scale combinatorial optimization problem which is difficult to solve. In order to improve the quality of solutions, an effective multi-objective parallel evolution algorithm(MPEA) framework with dynamic migration interval strategy is presented in this work. Firstly, multiple evolution populations are constructed to solve the problem simultaneously to enhance the optimization capability. Then a new strategy is proposed to dynamically change the migration interval among different evolution populations to improve the efficiency of the cooperation of populations. Finally, the cooperative co-evolution(CC) algorithm combined with non-dominated sorting genetic algorithm II(NSGA-II) is introduced for each population. Empirical studies using the real air traffic data of the Chinese air route network and daily flight plans show that our method outperforms the existing approaches, multiobjective genetic algorithm(MOGA), multi-objective evolutionary algorithm based on decomposition(MOEA/D), CC-based multi-objective algorithm(CCMA) as well as other two MPEAs with different migration interval strategies.     

Traffic class dependent routing in ISL networks

This work addresses traffic class dependent (TCD) routing, using different link-cost functions, in the intersatellite link (ISL) network of a nongeostationary packet-switched satellite communication system. Three different traffic classes are introduced, each with its particular optimisation criteria. Performance analysis of TCD routing, in terms of average packet delay and average data throughput of a particular traffic class, is evaluated for homogeneous and nonhomogeneous traffic scenarios using a specifically developed simulation model of the ISL network.     

Cooperative Routing for Maximizing Network Performance of Wireless Networks

To greatly increase spectral efficiency and improve network performance in wireless networks,a novel cooperative routing algorithm,namely maximum throughput cooperative routing(MTCR) algorithm,is proposed.According to cooperative link model,throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative commu-nication from physical layer to higher layer.Taking the throughput improvement as performance metric,a cooperative relay se-lection scheme is developed.Finally,based on the route constructed by adaptive forwarding cluster routing(AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the coopera-tive link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up.Simulation results show that compared with the noncooperative routing algorithm and minimum power selection de-code-and-forward(MPSDF) routing algorithm,the proposed algorithm can obviously improve network throughput in the pres-ence of low transmission power,large number of nodes and high spectral efficiency.     

Reinforcement learning based dynamic distributed routing scheme for mega LEO satellite networks

Recently, mega Low Earth Orbit (LEO) Satellite Network (LSN) systems have gained more and more attention due to low latency, broadband communications and global coverage for ground users. One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance, due to LSN constellation scale and dynamic network topology feature. In order to seek an efficient routing strategy, a Q-learning-based dynamic distributed Routing scheme for LSNs (QRLSN) is proposed in this paper. To achieve low end-to-end delay and low network traffic overhead load in LSNs, QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets. Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service (QoS) optimization during the routing maintenance process. In addition, comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.     

基于最短路径和负载动态的改进路由策略

随着计算机通讯技术的发展和网络的普及,信息资源日益膨胀,随时导致网络拥塞的发生,甚至造成网络崩溃。为了对网络拥塞进行控制,提出了基于最短路径和局部负载动态的改进路由策略。采用基于距离优先和度优先连接的复杂网络演化模型构建现实网络的模拟网络,并在此基础上再对所提出的改进路由策略进行仿真实验,仿真结果充分说明提出的改进路由策略在网络拥塞控制上效果更优。     

Multiple air route crossing waypoints optimization via artificial potential field method

Air route crossing waypoint optimization is one of the effective ways to improve airspace utilization, capacity and resilience in dealing with air traffic congestion and delay. However, research is lacking on the optimization of multiple Crossing Waypoints (CWPs) in the fragmented airspace separated by Prohibited, Restricted and Dangerous areas (PRDs). To tackle this issue, this paper proposes an Artificial Potential Field (APF) model considering attractive forces produced by the optimal routes and repulsive forces generated by obstacles. An optimization framework based on the APF model is proposed to optimize the different airspace topologies varying the number of CWPs, air route segments and PRDs. Based on the framework, an adaptive method is developed to dynamically control the optimization process in minimizing the total air route cost. The proposed model is applied to a busy controlled airspace. And the obtained results show that after optimization the safety-related indicators: conflict number and controller workload reduced by 7.75% and 6.51% respectively. As for the cost-effectiveness indicators: total route length, total air route cost and non-linear coefficient, declined by 1.74%, 3.13% and 1.70% respectively. While the predictability indicator, total flight delay, saw a notable reduction by 7.96%. The proposed framework and methodology can also provide an insight in the understanding of the optimization to other network systems.     

Oscillation suppression for traffic class dependent routing in ISL network

Adaptive per-hop routing in the intersatellite link (ISL) network of a packet-switched, nongeostationary satellite system is addressed. In particular, a traffic class dependent (TCD) routing is proposed with different optimization criteria for different traffic classes. Furthermore, for delay sensitive traffic, performance is enhanced by an exponential smoothing link-cost function, which reduces traffic load oscillations in the network. The performance of the proposed procedures is evaluated in two different traffic scenarios using an appropriate simulation model     

Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

基于功能脆弱性的空中交通相依网络流量分配

依据空中交通管理与航班运行规则,采用复杂网络理论构建由机场、航路与管制扇区组成的相依网络模型,建立不同扰动策略的影响规则,提出以网络流量熵和交通流损失比变化率为指标识别网络功能脆弱性。并以网络总流量熵最小为目标,建立基于改进遗传算法的网络流量协调分配策略,以降低空中交通相依网络的脆弱性。以民航华北地区空域为原型,发现了其相依网络脆弱性表现规律和脆弱源,采用遗传算法求解网络流量分配方案,优化结果降低了网络总熵值和功能脆弱性,其中机场网络流量分配后效果最为显著,验证了方法的有效性,研究结果可为空中流量管理决策提供一定的理论支撑。     

空中交通相依网络的脆弱性研究

机场、航路和管制扇区构成空中交通相依网络,节点在受到扰动时,网络运输性能下降,引发网络脆弱性。提出一种空中交通相依网络脆弱性的度量方法,首先构建机场网络、航路网络和管制扇区网络3个层网络,基于空中交通管理规则与层网络间的逻辑连接关系,建立空中交通相依网络模型。在随机扰动和蓄意扰动节点两种不同失效模式下,采用最大连通度和结构熵两个指标,并给出了相应算法,分析相依网络的结构脆弱性;创建流量熵和交通流损失比指标,设计了相应算法,研究相依网络的功能脆弱性。研究结果表明,随机扰动对空中交通相依网络影响更大;网络的结构脆弱源与功能脆弱源是机场网络;网络的脆弱性与层网络间的连接方式和层网络的交通量不匹配有关。     

基于IPSO-Elman神经网络的飞机客舱能耗预测

为了提高飞机客舱使用地面空调制冷时客舱能耗的预测精度，提出了一种改进的粒子群优化（IPSO）Elman神经网络的飞机客舱能耗预测模型。依据对算法中惯性权重与学习因子的收敛域分析，得出了二者合理的取值范围，将粒子到全局最优位置间距离与参数的取值范围相结合，构造了惯性权重与学习因子的动态调节函数，对其进行非线性的动态调节，并引入了变异因子，提出了一种跳出局部最优的策略，防止粒子群优化（PSO）陷入局部最优。将IPSO-Elman应用于Boeing738飞机客舱能耗预测中，与PSO-Elman、Elman算法进行性能比较，仿真结果表明基于IPSO-Elman的客舱能耗预测模型在预测精度和收敛速度方面均有一定的提升。该研究结果为飞机客舱能耗预测模型的建立提供了理论依据，对飞机地面空调的节能与机场电能合理调配提供了支持。     

空中交通网络模体识别及子图结构韧性评估

研究空中交通网络的结构特征是理解网络性质的重要手段。从局部角度出发,以构成空中交通网络的子图结构为研究对象,对其模体特性进行识别。通过对子图浓度在外界扰动下的变化情况进行分析,提出子图结构韧性概念以表征网络拓扑结构的动态演化规律。以华东地区空中交通网络为例,对低阶子图结构进行了模体特性识别,并对不同扰动下子图结构韧性的变化情况进行评估。实证结果表明,子图结构的模体特性符合空中交通网络的实际连通度需求;在网络受扰动及恢复过程中,子图相对浓度较为稳定,子图结构韧性和网络宏观结构变化之间较为一致。对于揭示节点间连接的偏好及航路结构合理性,网络受扰动及恢复过程背后的底层机制,网络整体与局部结构之间的关系等有着一定的研究意义。     

Update Chain-based Approach for Checking Route Oscillation of BGP

This paper presents a novel approach for checking route oscillation of border gateway protocol(BGP) quickly,by which the privacy of routing policies of autonomous system(AS) can be respected.Firstly,route update chain tag(RUCT) is constructed to track the forwarding of update report,and local routing library is made to record the changing history of update report.Then route oscillation can be identified by analyzing correlative state of RUCT and local routing library.The characteristic of this approach is that an arbitrary AS can check route oscillation alone only by sharing its network ID,which greatly respects the pri-vacy of routing policies for each AS.This paper shows that both looping in RUCT and consecutive positive-negative report in local record are sufficient conditions for route oscillation.Comparative experiments demonstrate the availability and efficiency of the proposed approach.