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

基于航班纯度鲁棒性机型指派问题研究 　　摘 要：机型指派问题(FAP)是指根据飞机舱位能力、运营成本、潜在收益及飞机可用性，将具有不同舱位容量的飞机指派给各定期航班的问题。它是飞机、机组排班问题的基础，是整个航班计划中的最核心环节。然而，单独的机型指派最优对整个航班计划而言，可能是次优的，甚或是不可行的。本文针对国内航班计划特点，从航班的角度，定义了航班纯度概念，并建立基于航班纯度的机型指派模型。最后，以国内某航空公司干线网络为实例，表明该研究具有很大的理论意义和实践价值。 　　关键词： 航班计划；机型指派；航班纯度 　　中图分类号：F560 文献标识码：A 文章编号：1003-5192(2011)01-0071-04 　　The Research on Robust Fleet Assignment Problem Based on Flight Purity 　　 　　ZHU Xing-hui, ZHU Jin-fu, GAO Qiang 　　(College of Civil Aviation, Nanjing University of Aeronautics Astronautics, Nanjing 210016, China) 　　Abstract: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. 　　Key words:flight scheduling; fleet assignment; flight purity 　　 　　1 引言 　　 　　机型指派问题(Fleet Assignment Problem:FAP)是指根据不同机型具有不同的舱位数量，运行成本和潜在收益，指派不同的飞机类型给定期航班［1］。它是航空公司航班计划的核心内容之一，机型指派的优劣不仅影响到航空公司的成本和收益，也影响到航班之间的衔接、飞机维修路径、机组排班以及登机口、停机位指派等后续环节。 　　在国外，航空运输发达，机型指派研究资料很充分，但主要集中于枢纽航线网络和日航班计划。Hanif［1］等对机型指派问题的模型及求解算法进行了综述研究。机型指派基本模型有链接网络［2］(Connection Network)和时空网络［3］(Time-space Network)模型。为减少机型指派问题规模，Hane［4］对时空网络提出了节点缩减(Node Aggregation)和孤岛(Island)等预处理方法。Rexing［5］等将航班时刻综合考虑，建立了基于“时间窗”的机型指派模型。Barnhart［6］和Jonathan［7］分别从旅客行程结构和网络效应构建了机型指派模型。在国内，定量研究不多，孙宏［8,9］等对