不确定需求下的两阶段机型指派模型  

Two-stage fleet assignment model with uncertain demand

作　　者：张春晓[1] 石晓磊[2] 臧其银 

机构地区：[1]中国民航大学天津市民用航空器适航与维修重点实验室,太原030001 [2]中国民航大学理学院,天津300300 [3]山东航空股份有限公司太原营业部,太原030001

出　　处：《中国民航大学学报》2015年第4期10-15,共6页Journal of Civil Aviation University of China

基　　金：中央高校基本科研业务费专项(3122014D034)

摘　　要：针对航空公司新开辟航线的机型指派问题,由于缺乏历史运营数据,无法得到乘客需求的概率分布,因此将需求描述为不确定变量。建立带有机会约束的两阶段机型指派0-1整数规划模型,第1阶段为机族指派,第2阶段对指定机族所属机型进行指派。给定新航线需求的不确定分布,将不确定整数规划模型转换成确定性模型,通过一个改进的分枝定界算法进行求解。算例采用某航空公司枢纽机场6条新航线共20个航班的数据进行分析,结果验证了模型的可行性和算法的有效性。For the fleet assignment problem of a new opening airline, the probability distribution of its demand cannot be obtained due to the absence of previous data. Therefore, the demands of new flights are assumed as uncertain variables. A binary integer programming model of two-stage fleet assignment with chance constrains is proposed,where the first stage makes family-assignment decision, and the second stage solves type-assignment problem for a certain aircraft family. Given the uncertain distribution form of new flight demand, the proposed model is converted into a deterministic programming model. An improved branch and bound algorithm is designed to solve this model. Finally, a numerical example considers the fleet assignment problem of twenty flights of six new opening routes in a hub airport, results indicate the proposed model and algorithm are effective in practice.

关 键 词：机型指派 新航线需求 不确定理论 两阶段 0-1整数规划 分枝定界算法 

分 类 号：V355[航空宇航科学与技术—人机与环境工程] TP319[自动化与计算机技术—计算机软件与理论]