Solving the large airline disruption problems using a distributed computation approach to integer programming

In this paper, a distributed implementation of Dang´s iterative method [1] is proposed to solve the airline disruption problems caused by the airport closures. The problem consists of two subproblems, and the solution domain of the first subproblem is divided into several segments by the initial seeds cluster division method. Dang´s method [1] is applied to solve the first subproblem in each segment simultaneously in a distributed computation network, and the obtained feasible flight routes are used to solve the second subproblem. Numerical results show that the proposed method is better than CPLEX and Liu et al. [2].