Airline Tail Number Assignment Problem In Miniature Mathematical Model And Algorithm

Airline operational planning, especially Tail Number Assignment (TNA), is very hard and important work, which quality and efficiency is concerned with the safety and benefit of airline operation. Because of the complexity of TNA problem, there is no acknowledged resolve means at present. The mathematical model is not proclaimed also.This dissertation determines the study subject as TNA problem in miniature.Theoretically, construct the mathematical model which is appropriate for airlines in China first. Then present the concept of restriction-space, and the result is circumscribed within restriction-space. Astringency analyze of simple ant algorithm is undertook based on Markov process. According as 60°principle of Geometry-informatics, the repulsive pheromone and attractive pheromone are introduced into ant algorithm, instead the only one pheromone and a new ant algorithm is developed. Contrast to full-search method and cupidity algorithm, the new ant algorithm is better than others.In practice, the TNA information system for Tianjin filiale of Air China is developed base on the mathematical model and the new ant algorithm, and as a subsystem of the Maintenance Management Information System, was checked and accepted by headquarters of Air China, realized the transform from theory into practice.