0-1 integer programming model for procedural separation of aircraft by ground holding in ATFM


ÖZGÜR M., CAVCAR A.

AEROSPACE SCIENCE AND TECHNOLOGY, cilt.33, sa.1, ss.1-8, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 33 Sayı: 1
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1016/j.ast.2013.12.009
  • Dergi Adı: AEROSPACE SCIENCE AND TECHNOLOGY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1-8
  • Anahtar Kelimeler: Air traffic flow management, Integer programming, Air traffic control procedural separation, TRAFFIC FLOW MANAGEMENT, OPTIMIZATION APPROACH, PART I, NETWORK
  • Anadolu Üniversitesi Adresli: Evet

Özet

This study presents a 0-1 integer programming model for air traffic flow management. The model is used for determining optimum departure times of aircraft so as to avoid aircraft conflicts and to balance capacity and demand on the airports. Standard air traffic control procedural separation minimas were set as conflict criteria, which has never been done before, and this makes it convenient for use in planning of flows in airspace sectors especially without surveillance system. The model was tested on an imaginary scenario, including an airspace sector, airport capacities and flight plans, and solved by a mathematical modelling and optimization software. Considering conflicts before takeoff, as in this study, might prevent riskier and costlier air traffic control measures such as heading, speed and flight level changes. The great need for these measures can be easily inferred from the solution results that presents delay times due to conflict related constraints. Utilizing both standard conflict criteria based on procedural separation minimas used in air traffic control and standard Air Traffic Flow Management strategy based on ground holding of aircraft in planning of flows, makes it easier to adapt the model to the current Air Traffic Flow Management system. (C) 2014 Elsevier Masson SAS. All rights reserved.