Conflict-free en-route operations with horizontal resolution manoeuvers using a heuristic algorithm

Cecen R. K., Cetek C.

AERONAUTICAL JOURNAL, cilt.124, sa.1275, ss.767-785, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 124 Sayı: 1275
  • Basım Tarihi: 2020
  • Doi Numarası: 10.1017/aer.2020.5
  • 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.767-785
  • Anahtar Kelimeler: aircraft conflict resolution, mixed integer linear programming, heuristic algorithm, air traffic flow management, AIR-TRAFFIC MANAGEMENT, COLLISION-AVOIDANCE, VELOCITY, SPEED, MODEL
  • Eskişehir Osmangazi Üniversitesi Adresli: Hayır

Özet

Aircraft conflict resolution is an important part of air traffic control operations. This study presents a mixed integer linear programming model (MILP) using a space discretisation technique to deal with aircraft conflict resolutions in en-route flight operations. The purpose of space discretisation is to concentrate on only the significant points of the airspace. The model integrates the multi entry point approach with an airspeed adjustment technique in the horizontal plane. The model aims to generate conflict-free trajectories while minimising the total changes in entry points and airspeed values. A new heuristic algorithm was developed due to the complexity of the problem. The computational results demonstrated that the proposed approach resolved aircraft conflicts for 450 different traffic scenarios in less than a minute. Considerable fuel savings were achieved with no significant increase in delay or flight time compared to conventional vectoring techniques in a fixed entry point airspace structure.