Optimal Integration of Departures and Arrivals in Terminal Airspace
Optimal Integration of Departures and Arrivals in Terminal Airspace
复制标题
航站楼空域出发和到达的优化整合
DOI：
10.2514/1.60489
复制
发表时间：
2012
影响因子：
2.6
通讯作者：
S. Zelinski
中科院分区：
文献类型：
--
作者：
Min Xue;S. Zelinski
与传统的调度问题相比。提出了一种基于非支配排序遗传算法（NSGA）的快速算法。它首先被应用到现有文献中介绍的测试问题。一个测试问题的实验表明，新的方法可以解决20架飞机的问题，在快速的时间与65%或440秒的延迟减少使用共享的出发修复。为了测试其在更现实和复杂的问题中的应用，NSGA算法被应用于LAX终端空域的问题，其中28%的LAX到达和10%的LAX离开之间的相互作用通过当前操作中的空间分离来解决，这可能会引入不必要的延迟。在这项工作中，使用新算法制定了三种类型的分离-空间，时间和混合分离。混合分离结合了时间分离和空间分离。结果表明，虽然在不确定性布尔较小的情况下，时间分离的延迟小于空间分离，但当不确定性布尔增大时，空间分离的延迟优于时间分离。混合分离引入了比空间和时间方法少得多的延迟。对于总共15个相互作用的出发和到达，当与空间分离相比时，混合分离的延迟减少在11%或3.1分钟和64%或10.7分钟之间变化，对应于从0到60秒的不确定性布尔。与NSGA算法相比，本文提出了一种基于先来先服务的启发式算法。实验结果表明，在不同的不确定性布尔大小下，NSGA算法的结果比启发式方法的延迟减少9%~ 42%。
compared to conventional scheduling problems. This paper presents a fast time algorithm formulation using a non-dominated sorting genetic algorithm (NSGA). It was first applied to a test problem introduced in existing literature. An experiment with a test problem showed that new methods can solve the 20 aircraft problem in fast time with a 65% or 440 second delay reduction using shared departure fixes. In order to test its application in a more realistic and complicated problem, the NSGA algorithm was applied to a problem in LAX terminal airspace, where interactions between 28% of LAX arrivals and 10% of LAX departures are resolved by spatial separation in current operations, which may introduce unnecessary delays. In this work, three types of separations ‐ spatial, temporal, and hybrid separations ‐ were formulated using the new algorithm. The hybrid separation combines both temporal and spatial separations. Results showed that although temporal separation achieved less delay than spatial separation with a small uncertainty buer, spatial separation outperformed temporal separation when the uncertainty buer was increased. Hybrid separation introduced much less delay than both spatial and temporal approaches. For a total of 15 interacting departures and arrivals, when compared to spatial separation, the delay reduction of hybrid separation varied between 11% or 3.1 minutes and 64% or 10.7 minutes corresponding to an uncertainty buer from 0 to 60 seconds. Furthermore, as a comparison with the NSGA algorithm, a First-Come-First-Serve based heuristic method was implemented for the hybrid separation. Experiments showed that the results from the NSGA algorithm have 9% to 42% less delay than the heuristic method with varied uncertainty buer sizes.