Arrival flights optimal sequencing with multi-path selection based on rolling horizon control

Arrival flight sequencing is an effective strategy to improve landing efficiency and reduce flight delays. On the basis of previous research, this paper aims to minimize the makespan of all flights landing, considers actual multi-waypoint constraints, and proposes a path and runway integrated model, in which runway and path assignment can be achieved simultaneously based on real constraints. In order to solve the model under large-scale conditions in real-time, a multi-way point rolling horizon control algorithm is proposed. In the verification part, we take the Guangzhou Baiyun International Airport terminal area as the background and use the actual arrival data to carry out the calculation experiment. In the wake safety interval, we adopt a more detailed RECAT-CN operating standard. Based on the data from the 23 flights, the computational findings demonstrate that the presented methodology reduces wait times by 271 seconds and 55 seconds when compared to first-come, first-served and natural sequencing, respectively. Using the data of 104 flights to test the solving ability, the computational results show the solving time is 128.65 seconds with the proposed algorithm while no feasible solution is found within 3600 seconds by solver. It will state the proposed model and algorithm works well and could be used in real sequencing.