航空公司机队的鲁棒性规划启发式算法

为了解决传统机队规划方法无法反映机队运营鲁棒性的缺陷, 针对单基地线性航线结构运营模式特点, 以基地机场配置机型数最小为目标函数, 考虑"航班节"机型分配成本限制, "航班节"机型分配唯一性限制, 所选机型最少飞机数限制等条件构建机队的鲁棒性规划模型, 并结合唯一竞争机型限制为模型设计启发式算法. "39个航班节, 6种候选机型"的案例分析表明: 传统机队规划法所得出的机队构成中有3种机型, 而由机队的鲁棒性规划法所得出的机队构成中机型数仅为2种, 且机队构成能够很好的适应市场需求的波动, 因此算法可行.

Heuristic algorithm to incorporating robustness into airline fleet planning

Traditional airline fleet planning methods could not reflect the robustness of fleet composition. In order to solve this shortcoming for airlines which operated in single-base linear route structure operating mode, this paper regarded minimum aircraft types deployed on single-base airport as objective, with flight pairing fleet assignment cost constraint, flight pairing fleet assignment uniqueness constraint, and least numbers of selected aircraft types constraint, to incorporate robustness into airline fleet planning model. Combining with only one competitive aircraft type in a desired fleet composition, the simulated annealing algorithm was employed to design heuristic algorithm for this proposed model. An empirical example containing 39 flight parings and 6 candidate aircraft types indicates that the fleet composition derived from traditional fleet planning method has three aircraft types while the proposed algorithm has only two. Furthermore, the fleet composition can well adapt to the market fluctuations, so the algorithm is feasible.