Research on mixed set programming for aircraft schedule recovery

Author

Bo Zhu ; Jinfu Zhu

Author_Institution

Coll. of Civil Aviation, Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China

fYear

2011

fDate

22-22 Oct. 2011

Firstpage

25

Lastpage

31

Abstract

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.

Keywords

aircraft; computational complexity; formal languages; greedy algorithms; scheduling; search problems; set theory; simulated annealing; NP-hard problem; aircraft failure; aircraft schedule recovery problem; airline flight schedule; bad weather; greedy simulated annealing algorithm; mixed set programming; natural constraint language model; search rule; aircraft schedule recovery; greedy simulated annealing; irregular flight; mixed set programming; natural constraint language;

fLanguage

English

Publisher

iet

Conference_Titel

Advanced Forum on Transportation of China (AFTC 2011), 7th

Conference_Location

Beijing

Electronic_ISBN

978-1-84919-571-3

Type

conf

DOI

10.1049/cp.2011.1371

Filename

6232038