An algorithm for optimal arrival flight sequencing and spacing in a near-terminal area is proposed. The optimization problem and algorithm proposed in this paper are developed for a decision-support tool for air-traffic control, which uses discrete delay times as optimization variables. The algorithm is applicable to various scenarios with situational and operational constraints such as maximum position shift (MPS) constraints or different sets of discrete delay times, depending on aircraft types or approaching routes. The proposed algorithm is based on a branch-and-bound algorithm with linear programming (LP) and Lagrangian dual decomposition. We formulate the sequencing and scheduling problem as LP with linear matrix inequalities (LMIs), which allows computing the lower bound of the cost for the best first search in the branch-and-bound algorithm and propose Lagrangian dual decomposition for computational efficiency. The proposed algorithm is analyzed and validated through illustrative air-traffic scenarios with various operational constraints, and the simulation results show that the computation time can be significantly reduced using the proposed Lagrangian dual-decomposition method.
Optimal Arrival Flight Sequencing and Scheduling Using Discrete Airborne Delays
IEEE Transactions on Intelligent Transportation Systems ; 11 , 2 ; 359-373
2010
15 Seiten, 33 Quellen
Article (Journal)
English
Optimal Arrival Flight Sequencing and Scheduling Using Discrete Airborne Delays
Online Contents | 2010
|Arrival Flight Scheduling Through Departure Delays and Reroutes
Online Contents | 2009
|Delay Exchanges in Arrival Sequencing and Scheduling
AIAA | 1999
|Delay Exchanges in Arrival Sequencing and Scheduling
British Library Conference Proceedings | 1998
|