Optimization of multi-path approach flight sequencing based on rolling horizon control

Arrival flight sequencing optimization is an effective method to improve the landing efficiency of incoming flights and reduce flight delays. Based on this, with the goal of maximizing landing efficiency, combined with multi-runway and multi-route selection, and considering the actual waypoint restrictions, a mixed integer programming model for multi-path and multi-runway integrated arrival flight sequencing optimization is proposed. In order to solve the real-time problem of large-scale flight sequencing calculation, a multi-waypoint rolling horizon control algorithm is proposed. The terminal area of Guangzhou Baiyun International Airport is used as an example for verification, and the actual arrival flight data is used to carry out calculation experiments. In terms of wake turbulence safety interval, the RECAT-CN operation standard is used. The calculation results show that when the number of small-scale flights (23 flights) is small, the maximum landing time of the proposed model is 55 s earlier than the first-come-first-served method and 271 s earlier than the non-optimized one; when the number of large-scale flights (104 flights) is large, the solver alone cannot find a feasible solution within 3600 s, and the proposed algorithm finds a solution within 128.65 s. The proposed model and algorithm are effective and can be applied to actual flight scheduling optimization.

Authors

Publication Details

Journal
Scientific insights and discoveries review
Published
2024-10-11
DOI
https://doi.org/10.59782/sidr.v3i1.134
Primary Topic
Air Traffic Management and Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimization of multi-path approach flight sequencing based on rolling horizon control

Meilong Le, Wu Xiansheng, Hu Juming
1 links
Scientific insights and discoveries review
Air Traffic Management and Optimization
article

Optimization of multi-path approach flight sequencing based on rolling horizon control

Meilong Le, Wu Xiansheng, Hu Juming
article en

Abstract

Arrival flight sequencing optimization is an effective method to improve the landing efficiency of incoming flights and reduce flight delays. Based on this, with the goal of maximizing landing efficiency, combined with multi-runway and multi-route selection, and considering the actual waypoint restrictions, a mixed integer programming model for multi-path and multi-runway integrated arrival flight sequencing optimization is proposed. In order to solve the real-time problem of large-scale flight sequencing calculation, a multi-waypoint rolling horizon control algorithm is proposed. The terminal area of Guangzhou Baiyun International Airport is used as an example for verification, and the actual arrival flight data is used to carry out calculation experiments. In terms of wake turbulence safety interval, the RECAT-CN operation standard is used. The calculation results show that when the number of small-scale flights (23 flights) is small, the maximum landing time of the proposed model is 55 s earlier than the first-come-first-served method and 271 s earlier than the non-optimized one; when the number of large-scale flights (104 flights) is large, the solver alone cannot find a feasible solution within 3600 s, and the proposed algorithm finds a solution within 128.65 s. The proposed model and algorithm are effective and can be applied to actual flight scheduling optimization.

Scientific insights and discoveries reviewVol. 3
Affordable and clean energy
Openalex Percentile: Top 73%
Air Traffic Management and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.