Optimal Arrival Flight Sequencing and Scheduling Using Discrete Airborne Delays

Cited 33 time in webofscience Cited 0 time in scopus
  • Hit : 375
  • Download : 0
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.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2010-06
Language
English
Article Type
Article
Keywords

LAGRANGEAN DECOMPOSITION; CONSTRAINTS; MODEL

Citation

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, v.11, no.2, pp.359 - 373

ISSN
1524-9050
DOI
10.1109/TITS.2010.2044791
URI
http://hdl.handle.net/10203/99598
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 33 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0