基于航班纯度的鲁棒性机型指派问题研究  

The Research on Robust Fleet Assignment Problem Based on Flight Purity

作　　者：朱星辉[1] 朱金福[1] 高强[1] 

机构地区：[1]南京航空航天大学民航学院,江苏南京210016

出　　处：《预测》2011年第1期71-74,共4页Forecasting

基　　金：国家自然科学基金资助项目(70771046);南京航空航天大学创新基金资助项目(S0849-072)

摘　　要：机型指派问题(FAP)是指根据飞机舱位能力、运营成本、潜在收益及飞机可用性,将具有不同舱位容量的飞机指派给各定期航班的问题。它是飞机、机组排班问题的基础,是整个航班计划中的最核心环节。然而,单独的机型指派最优对整个航班计划而言,可能是次优的,甚或是不可行的。本文针对国内航班计划特点,从航班的角度,定义了航班纯度概念,并建立基于航班纯度的机型指派模型。最后,以国内某航空公司干线网络为实例,表明该研究具有很大的理论意义和实践价值。The airline fleet assignment deals with assigning aircraft types to the scheduled flight legs based on aircraft capabilities, operational costs, potential revenues and aircraft availabilities. An airline＇ s fleet assignment decision is essential component of its overall scheduling process. However, an optimal solution for the fleet assignment is not necessarily optimal for the entire flight scheduling system, and can even yield an infeasible input to the subsequent processes, such as aircraft maintenance routing. This paper presents the notion of flight purity and builds fleet assignment model subjected to flight purity according to the characters of domestic airline network and flight scheduling. At last, the instance with 48 aircrafts and 1786 flight legs were testified, and the computational results reveal that theoretical value and practical significance of the research.

关 键 词：航班计划 机型指派 航班纯度 

分 类 号：F560[经济管理—产业经济]