摘要
讨论了机场终端区飞机到达流的排序规划问题。为了能够在终端区交通繁忙的情况下高效地为到达的飞机流安排合理的着陆次序，并在不违反飞机间距要求的情况下给出各飞机经过优化的着陆时间，提高机场跑道的利用率，提出了经过改进的先来先服务、带有时间提前量、带有约束的位置偏移三种排序算法。当进入机场终端区的飞机数量超过机场终端区的容量时。
The sequencing algorithms for arrival traffic of airport are discussed. The Mo dified First Come First Served algorithm, Time Advance algorithm and Constrained Position Shift algorithm are put forward to automatically plan the most efficient landing order, to assign optimal spaced landing times to all arrivals without violate the spacing requirements for different types of aircraft and to enhance the usage of the runway under heavy traffic condition in the terminal area. Considering the actual situation in the airport, when the traffic expected to arrive in the terminal area exceeds its capacity, we developed a Miles In Trail algorithm to restrict traffic in each stream.
出处
《南京航空航天大学学报》
EI
CAS
CSCD
北大核心
1999年第2期178-184,共7页
Journal of Nanjing University of Aeronautics & Astronautics
基金
国家自然科学基金
