Aircraft route recovery based on distributed integer programming method

• Published in: Mathematical biosciences and engineering : MBE Vol. 20; no. 7; pp. 12802 - 12819
• Main Authors: Yang, Luyao, Wang, Zhikang, Yu, Haochen, Jiang, Baoping, Wu, Zhengtian
• Format: Journal Article
• Language: English
• Published: United States AIMS Press 01.01.2023
• Subjects: distributed computing; fixed-point iteration; flight interruption; integer programming; fixed-point iteration; integer programming; distributed computing; flight interruption
• ISSN: 1551-0018; 1551-0018
• DOI: 10.3934/mbe.2023571

In order to further promote the application and development of unmanned aviation in the manned field, and reduce the difficulty that airlines cannot avoid due to unexpected factors such as bad weather, aircraft failure, and so on, the problem of restoring aircraft routes has been studied. To reduce the economic losses caused by flight interruption, this paper divides the repair problem of aircraft operation plans into two sub problems, namely, the generation of flight routes and the reallocation of aircraft. Firstly, the existing fixed-point iteration method proposed by Dang is used to solve the feasible route generation model based on integer programming. To calculate quickly and efficiently, a segmentation method that divides the solution space into mutually independent segments is proposed as the premise of distributed computing. The feasible route is then allocated to the available aircraft to repair the flight plan. The experimental results of two examples of aircraft fault grounding and airport closure show that the method proposed in this paper is effective for aircraft route restoration.