A Study on Disrupted Flight Recovery Based on Logic-Based Benders Decomposition Method

Abstract

Aiming at the disrupted flight recovery problem, this paper established a mixed-integer programming model based on the resource assignment model to minimize the recovery cost. To deal with the large-scale examples, the Logic-Based Benders decomposition algorithm is designed to divide the problem into a master problem and sub-problems. The algorithm uses MIP in the master problem to determine flight cancellations and aircraft replacements. In the sub-problems, MIP or CP is used to determine the departure time of delayed flights. Later, incorporating sectional constraints into the main problem and iterating until an optimal solution is obtained. Furthermore, the added cutting plane constraint in the iterations of the Benders decomposition algorithm are strengthened to eliminate more inferior solutions. By comparing the results of CPLEX, the Logic-Based Benders decomposition algorithm, and the enhanced Benders decomposition algorithm, it is verified that the improved Benders decomposition algorithm can solve large-scale examples more efficiently with a faster time and fewer iterations.

Keywords

• disrupted flight schedule recovery
• logic-based benders decomposition algorithm
• integer programming model
• constraint programming model