Optimising aircraft arrivals in terminal airspace by mixed integer linear programming model

Cecen R. K., Cetek F. A.

AERONAUTICAL JOURNAL, cilt.124, sa.1278, ss.1129-1145, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 124 Sayı: 1278
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1017/aer.2020.15
  • Dergi Adı: AERONAUTICAL JOURNAL
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC
  • Sayfa Sayıları: ss.1129-1145
  • Anahtar Kelimeler: Air traffic flow management, conflict-free arrival sequencing, mixed integer linear programming, goal programming, extended terminal airspace, SCHEDULING MODELS, TRAFFIC-CONTROL, RUNWAY, ALGORITHMS, AIRPORTS
  • Eskişehir Osmangazi Üniversitesi Adresli: Hayır

Özet

Air traffic flow becomes denser and more complex within terminal manoeuvering areas (TMAs) due to rapid growth rates in demand. Effective TMA arrival management plays a key role in the improvement of airspace capacity, flight efficiency and air traffic controller performance. This study proposes a mixed integer linear programming model for aircraft landing problems with area navigation (RNAV) route structure using three conflict resolution and sequencing techniques together: flexible route allocation, airspeed reduction and vector manoeuver. A two-step mixed integer linear programming model was developed that minimises total conflict resolution time and then total airborne delay using lexicographic goal programming. Experimental results demonstrate that the model can obtain conflict-free and time optimal aircraft trajectories for RNAV route structures.