A Rolling Horizon Based Algorithm for Solving Integrated Airline Schedule Recovery Problem
Dong Zhang and Henry Y. K. Lau
The University of Hong Kong, Hong Kong
Abstract—Airline disruption incurred huge cost for airlines and serious inconvenience for travelers. In this paper, we study the integrated airline schedule recovery problem, which considers flight recovery, aircraft recovery and crew recovery simultaneously. First we built an integer programming model which is based on traditional set partitioning model but including flight copy decision variables. Then a rolling horizon based algorithm is proposed to efficiently solve the model. Our algorithm decomposes the whole problem into smaller sub-problems by restricting swapping opportunities within each rolling period. All the flightsare consideredin each sub-problem to circumvent ‘myopic’ of traditional rolling horizon algorithm. Experimental results show that our method can provide competitive recovery solution in both solution quality and computation time.
Index Terms—Airline recovery, flight recovery, crew recovery, rolling horizon
Cite: Dong Zhang and Henry Y. K. Lau, "A Rolling Horizon Based Algorithm for Solving Integrated Airline Schedule Recovery Problem," Jounal of Automation and Control Engineering, Vol. 2, No. 4, pp. 332-337, December, 2014. doi: 10.12720/joace.2.4.332-337
Index Terms—Airline recovery, flight recovery, crew recovery, rolling horizon
Cite: Dong Zhang and Henry Y. K. Lau, "A Rolling Horizon Based Algorithm for Solving Integrated Airline Schedule Recovery Problem," Jounal of Automation and Control Engineering, Vol. 2, No. 4, pp. 332-337, December, 2014. doi: 10.12720/joace.2.4.332-337