Dynamic Arrival Sequencing & Scheduling Based on Branch & Bound Algorithm

Authors

Junfeng Zhang, School of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;
Wang Fei, School of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;
Tengteng Ge, School of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;

Abstract

Abstract: Optimization of arrival sequencing and scheduling is not only the prerequisite for properly allocating and fully utilizing the runway resource, but also the fundamental element for improving terminal operation efficiency. Dynamic arrival sequencing was obtained by time-triggered sliding time window method. On the basis of accurate 4D trajectory prediction, branch and bound algorithm was adopted to generate an optimal sequence, combined with the actual operation constraints. Taking Shanghai Pudong Airport as an example for simulation, the optimization results were compared with the actual landing time and simulation results based on first come first serve strategy. The results indicate that the proposed algorithm could effectively not only enhance the runway capacity but also alleviate flight delays, and could be an effective method to realize runway resource proper allocation.

Recommended Citation

Zhang, Junfeng; Fei, Wang; and Ge, Tengteng (2020) "Dynamic Arrival Sequencing & Scheduling Based on Branch & Bound Algorithm," Journal of System Simulation: Vol. 28: Iss. 8, Article 29.
Available at: https://dc-china-simulation.researchcommons.org/journal/vol28/iss8/29

First Page

1909

Revised Date

2015-11-10

DOI Link

https://doi.org/

Last Page

1914

CLC

V355

Recommended Citation

Zhang Junfeng, Wang Fei, Ge Tengteng. Dynamic Arrival Sequencing & Scheduling Based on Branch & Bound Algorithm[J]. Journal of System Simulation, 2016, 28(8): 1909-1914.