近距平行跑道航班着陆调度研究  

Scheduling Aircraft Landings to Closely Spaced Parallel Runways

作　　者：王俊义[1] 王兴隆[1] 

机构地区：[1]中国民航大学空中交通管理学院,天津300300

出　　处：《航空计算技术》2017年第1期63-65,共3页Aeronautical Computing Technique

基　　金：国家自然科学基金项目资助(61571441)

摘　　要：针对我国航空运输业快速发展导致空中交通拥挤以及航班延误问题,研究了近距平行跑道航班着陆调度问题,以缓解空中交通拥挤和减少航班延误。以配对进近的形式,考虑时间、配对、间隔、排序等因素,建立航班着陆调度模型。针对机场小规模的进场航班流量,采用穷举法求解,并用算例进行仿真验证。结果表明,与先到先服务原则相比,经算法调度的进场航班总的延误时间减少了33%。This paper studied on the scheduling aircraft landings to closely spaced parallel runways to solve those problems which the rapid developing aviation industry in China eventually leaded to the air traffic congestion and flight delays.Meanwhile,it aimed to ease the situation of air traffic congestion,reduce the aircraft delays at the airport.In the form of pairing,subject to temporal,pairing,sequencing and separationto establish the model.For the small fight arrival flow,the method of exhaustion was adopted to solve the problems,meanwhile,take the example to verify the true or false.Results showed that compared with the first come first service sorting method,after the sort algorithm,the total flight delay time would be reduced by 33%.

关 键 词：近距平行跑道 航班着陆 配对进近 穷举法 

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