摘要
讨论了空中交通流量管理中终端区航班的排序规划问题。目的是在终端区空中交通繁忙的情况下有效地为到达航班安排合理的着陆次序,并在不违反飞机间隔要求的情况下给出各飞机经过优化的着陆时间,提高机场跑道的利用率。引入离场起飞的航班问题,建立了航班排序的动态模型和基于遗传算法的终端区动态排序算法。并对一个算例采用本文方法进行验证计算,结果表明,所提出的方法计算效率高,实用可行。
The sequencing of air traffic flow in the controlled approaching area is discussed, aimed at having effective and rational sequencing amid the most busiest traffic hours for arriving air craft. Its proposal is to effectively arrange a rational sequencing for landing process of arrivals and give airplanes an optimal landing time in the rush hours without any viola- tion to the distancing requirement for them. Having included the departure flights sequencing problem,it establishes the flight sequencing dynamic model and dynamic sequencing algorithm based on genetic method for sequencing within final approaching area,which is used to solve aircraft sequencing problem (ASP) of both departure and arrival and to testify the example contained in the document 1,with the calculation method specified. The result shows the method is effective and practical.
出处
《中国民航学院学报》
2005年第4期6-9,共4页
Journal of Civil Aviation University of China
基金
教育部"春晖计划"资助项目.
关键词
空中交通管制
排序
遗传算法
air traffic control
sequencing
genetic algorithms