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

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 int...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Aerospace Ročník 11; číslo 5; s. 378
Hlavní autoři: Peng, Yunfang, Hu, Xuechun, Xia, Beixin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.05.2024
Témata:
Air transportation industry
Air travel
Aircraft
Airlines
Airports
Algorithms
Analysis
Artificial intelligence
Aviation
Benders decomposition
constraint programming model
Decomposition
disrupted flight schedule recovery
Economic aspects
Flight
Heuristic
Integer programming
integer programming model
Linear programming
Logic
logic-based benders decomposition algorithm
Methods
Mixed integer
Optimization techniques
Passengers
Recovery
Scheduling
Traffic flow
ISSN:2226-4310, 2226-4310
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2226-4310
2226-4310
DOI:10.3390/aerospace11050378