›› 2013, Vol. 31 ›› Issue (2): 57-62.

• Civil Aviation • Previous Articles     Next Articles

Tail assignment problem based on flight-loop

LIU Shan,HAO Li-dong,ZHANG Lin-ling,CAO Sheng-wen   

  1. (College of Computer Science & Technology,CAUC,Tianjin 300300,China)
  • Received:2012-06-10 Revised:2012-07-11 Online:2013-04-23 Published:2013-10-08

Abstract:

Tail assignment is the basic work in the airline manufacturing operations process,but it directly impacts the costs of the airline operating and the safety of flight. In this article,firstly,we found the integer programming model of flight-loop construction aiming to maximum the maintenance opportunity and made use of the combination of the column generation and Floyd shortest path algorithm to generate the flight-loop of multimaintenance 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 correctness and efficiency of the method.

Key words: flight-loop, column generation algorithm, Floyd algorithm, KM perfect match

CLC Number: