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.

Key words: transportation planning, sequencing and scheduling, sliding time window, branch and bound algorithm, decision support