Dynamic Robust Sequencing and Scheduling Under Uncertainty for the Point Merge System in Terminal Airspace

Abstract

This paper proposes a new sequencing and scheduling algorithm for the point merge system based on mixed integer linear programming considering the uncertain flight time of aircraft. In the first stage of the proposed algorithm, for a static environment, deterministic robust solutions are determined. To consider the uncertainty, an extra buffer is introduced in the sequencing and scheduling algorithm, and the buffer size is analytically derived by generating a deterministic robust counterpart problem. In the second stage, to compensate for unforeseen situations under a dynamic environment, the static solution determined in the first stage is adjusted by using the proposed heuristic algorithm, with a sliding time window to reduce the computational load. The performances of the proposed algorithm are verified via numerical simulations based on historical data analysis.