Research on mixed set programming for aircraft schedule recovery

Bad weather and aircraft failure are often the causes that the airline´s flight schedule cannot be processed as planned. Aircraft Schedule Recovery problem is a typical NP-Hard problem. Different from Mixed Integer Programming, this -research proposes a Mixed Set Programming method to solve the problem by building a Natural Constraint Language model and designing efficient search rules. Instances of different scales are tested respectively using the Greedy Simulated Annealing Algorithm and MSP to analyze the feasibility of the MSP method in solution quality and time efficiency.