摘要
飞机尾号分配问题是航空公司生产运营过程中一项重要工作,其结果直接影响到航空公司的运营成本和飞行安全等。首先以飞机维修机会最大为目标建立了航班环生成模型,利用列生成算法和Floyd最短路算法的结合生成了满足3天维修计划的多维修基地航班环;其次,利用分支定界算法得到了航班环生成模型的0-1最优解;再次,采用KM算法完成了飞机与航班环的完美匹配,实现了航班环的动态分配;最后,通过对一个算例的分析,验证了所提出方法的正确性和有效性。
Tail assignment is the basic work in the aMine manufacturing operations process, but it directly impacts the costs of the airline operating and the safety of flight. In this article, firstly, we tound the integer programming model of flight-loop construction aiming to maximum the maintenance opportunity and made use of the combination of the colunm generation and Floyd shortest path algorithm to generate the flight-loop of muhi- maintenance base. Secondly, we used program by Matlab of branch-and-bound to obtain 0-1 optimal solution of programming model. Then, adopted the KM algorithm to complete the perfect match of the aircraft and flight-loop and realized the dynamic allocation of the flight-loop. Finally, through analyse of an instance we validated the con＇ectness and efficiency of the method.
出处
《中国民航大学学报》
CAS
2013年第2期57-62,共6页
Journal of Civil Aviation University of China
基金
国际合作与交流专项基金(2008DFA12300)
