基于航班机型分配的机队规划启发式算法  

Heurist algorithm of fleet planning based on airline fleet assignment

作　　者：汪瑜[1] 孙宏[1] 

机构地区：[1]中国民航飞行学院航空运输管理学院,广汉618307

出　　处：《系统工程理论与实践》2011年第2期371-378,共8页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(60776820);中国民航飞行学院科研基金(J2008-76)

摘　　要：为了解决传统机队规划方法无法准确反映航空公司运营环境的问题,从航班机型分配的角度为航空公司设计机队规划算法,其基本思想是:给定候选机型以及航空公司生产运营环境(航线网络、航班计划、航班订座需求和平均票价水平),利用航班机型分配寻找最优的机队配置方案.将航班机型分配描述为时序网络图中的网络流问题,以"航班节-航班机型分配"成本最小为目标函数,机队中有且仅有一种竞争机型,被选用机型最低飞机数为约束条件设计模拟退火算法.仿真结果表明:对规模为13个航班节,7种候选机型的问题,算法平均运算时间为5.42秒,结果稳定且高效可行.Traditional fleet planning methods could not accurately reflect airlines＇ operation environment. In order to solve this problem,based on airline fleet assignment technique,this research constructed a new fleet planning algorithm.The basic idea was given candidate aircraft types and airline＇s production and operation environment,which contained route network,flight schedule,traffic demand and mean fare level,this algorithm used fleet assignment technique to optimize airline fleet composition.Firstly,the flight fleet assignment was described as a network flow model in time sequence network.Secondly,the algorithm regarded the minimum＂flight pairings-aircraft type assignment＂cost as objective function,there and there only one competitive aircraft type in the fleet and lowest numbers of selected aircraft types were taken as constraints.Finally,the simulated annealing algorithm was set up.Simulation shows that for problem which scale is 13 flight pairings and 7 candidate aircraft types,the average calculating time is 5.42 seconds, results are stable and feasible.

关 键 词：机队规划 航班机型分配 时序网络图 模拟退火 

分 类 号：F270.5[经济管理—企业管理]