基于多目标动态规划的多跑道进港排序  

Multi-objective dynamic programming algorithm for aircraft arrival sequencing and runway scheduling

作　　者：应圣钢[1] 孙富春[1] 胡来红[1,2] 刘华平[1] 张学军[3] 

机构地区：[1]清华大学智能技术与系统国家重点实验室,北京100084 [2]第二炮兵工程学院,陕西西安710025 [3]北京航空航天大学电子信息工程学院,北京100191

出　　处：《控制理论与应用》2010年第7期827-835,共9页Control Theory & Applications

基　　金：国家杰出青年科学基金资助项目(60625304);国家自然科学基金面上项目资助项目(60572178)

摘　　要：随着航空运输的高速增长,航班延误日益严重,而对飞机进行进港排序和跑道调度能有效提高机场吞吐量、减少飞机燃油花费,从而减轻航班延误,提升经济效益.由于大量飞机的多跑道进港优化调度问题是一个非确定型多项式完全(NP-C)问题,该问题一直没有得到有效解决.本文针对已有的基于位置交换束缚的单跑道动态规划算法运算量大、运算效率低的不足,采用优化解空间的措施并运用贪心策略,同时将其推广到双跑道调度,从而解决大量飞机的双跑道、多目标进港排序优化问题.大量仿真实验表明,该算法复杂度与飞机数量呈近似线性关系,能在较短时间内对吞吐量和降落花费同时实现优化.Optimization of runway scheduling for aircraft landings plays an important role in modem air traffic control, by maximizing throughput of an airport and minimizing fuel cost of aircrafts. As a nondeterministic polynomialcomplete（NP-C） problem, the runway scheduling of a considerable number of aircrafts in a multirunway airport hasn＇t been effectively solved. Because of considerable computation required by the traditional dynamic programming algorithm under constrained position shifting（CPS）, we can only sequence aircrafts and schedule the time of arrival in a single-runway airport. This paper presents a new dynamic programming algorithm by changing the way of recurrence and combining the traditional one with several other methods including a greedy algorithm. Our algorithm can solve the problem of multirunway scheduling with multi-object efficiently and effectively. A large number of experiments show that the complexity of the algorithm is almost linearly proportional to the number of aircrafts, and the algorithm can optimize both throughput and landing cost simultaneously in a short period of time.

关 键 词：进港排序 多跑道调度 多目标优化 

分 类 号：V355[航空宇航科学与技术—人机与环境工程]