摘要
目前对于飞机维修计划的研究,大都通过精确算法一次性完成周期内所有飞机的排班优化。本文在分析传统数学规划模型的基础上,以最大化利用两次维修之间的可用飞行时间为目标,构造了飞机维修计划优化模型。然后提出了求解此模型的启发式两阶段分解算法,第一阶段优先完成需维修飞机的任务指派,第二阶段再完成余下飞机的任务指派。利用航空公司真实数据进行的数值试验表明,两阶段分解算法能够显著提高模型的求解效率和质量,可以有效求解大规模飞机维修计划制定问题。
Based on literature review of aircrafts maintenance routing problem, a new two-stage model is pro- posed in this paper. This model aims to maximize utilization of available flying time between two maintenances. By using a heuristic two-stage algorithm, we find a highly efficient way to solve the problem when dealing with large scale data. Computational test shows that models generated from real application data of an airline company can be solved efficiently within reasonable time.
出处
《运筹与管理》
CSSCI
CSCD
北大核心
2016年第3期1-10,共10页
Operations Research and Management Science
关键词
飞机维修计划
优化模型
两阶段算法
aircrafts maintenance routing
optimization model
two-stage algorithm
