摘要
机型指派是飞机排班工作的基础和前提,对飞机排班的结果有着巨大的影响。机型指派是给每个航班指派一种特定的机型,旨在满足安全性和旅客需求的前提下达到收益最大。指派中的航班数量众多且涉及诸多约束条件,是典型的NP难问题。同时航空公司采用的人工排班方式耗时长,效率低。针对上述问题,首先基于航班环建立以一天为周期的机型指派优化模型,采用改进的遗传算法求解模型,最后利用Delphi编程实现计算机的智能指派。通过对航班的指派方案进行仿真,结果表明,上述方案在飞机利用率、成本优化和排班时间上都有很大的提高。上述方案可为航空公司决策者提供决策支持。
Fleeting assignment problem (FAP) is the basis and premise of aircraft scheduling, making a great difference on aircraft scheduling. FAP is assigning an aircraft type to each flight, aiming at getting maximum revenue under the condition of meeting the security and passenger demand. It is a NP - hard problem for it includes a large number of flights and constrains. And the way of manual scheduling adopted by the airlines is time - consuming and inefficient. To solve the problems, an optimization model of FAP of one - day - cycle was established and an im- proved genetic algorithm was constructed to solve it. The simulation of intelligent assignment on the computer was completed based on the Delphi program technique. Compared with the solution based on the flights, the solution based on the flight strings has a better performance on aircraft utilization, cost reduction and efficiency. The program can provide decision support for policymakers of airlines.
出处
《计算机仿真》
CSCD
北大核心
2016年第12期42-46,共5页
Computer Simulation
基金
基金项目:基于智能算法的民航飞机维修管理调度优化方向研究(U1233107)
关键词
机型指派
航班环
机型
遗传算法
Fleet assignment
Flight string
Flight type
Genetic algorithm