飞行员全动模拟机复训问题求解  

Solution of pilots' full flight simulator recurrent training problem

作　　者：高敏刚[1] 许保光[1] 池宏[1] 

机构地区：[1]中国科学院科技政策与管理科学研究所,北京100190

出　　处：《系统工程理论与实践》2014年第6期1462-1467,共6页Systems Engineering-Theory & Practice

基　　金：中国科学院科技政策与管理科学研究所重大研究任务(航空运输安全管理研究)(Y201181Z01)

摘　　要：针对无训练资源约束的飞行员全动模拟机复训问题,构建双目标整数规划模型对问题进行刻画,通过构造网络流、二部图和加权路等一系列网络规划模型,将原问题转化为最小费用最大流和最长路求解问题,并设计多项式启发式算法对问题进行求解,证明所得解为原问题的非劣解.最后,实证说明了模型和算法的有效性.A bi-objective mathematical programming model is developed to describe pilots＇ full flight simulator （FFS） recurrent training problem without considering resource constraints, A series of graph theory models are constructed such as network flow models, bipartite graph models and weighted paths. Then the FFS recurrent training problem is converted into the rain-cost max-flow problem and the longestpath problem. A polynomial heuristic algorithm is designed to solve the problem. All its solutions are non-inferior solutions. At last the effectiveness of the models and algorithm is demonstrated with a case study for an airline.

关 键 词：飞行员全动模拟机复训 多目标分配问题 网络规划 多项式算法 

分 类 号：F562.3[经济管理—产业经济] F224