Uçak Çakışma Saptama Ve Çözümleme Problemi için Karma Tam Sayılı Doğrusal Programlama Modeli Yaklaşımı

Abstract

An increasing demand in air transportation leads to a significant rise in traffic density both at airspaces and at airports. This rise in air traffic density may cause both delays and conflicts between aircraft pairs. Aircraft conflict detection and resolution problem is discussed in this study and a mixed integer linear programming model is proposed for this problem. A baseline case was generated to test the proposed mathematical model. The baseline case decides which aircraft receive delay for the resolution of conflicts, with the principle of the first come first served. The proposed model minimizes total delay time and total fuel consumption due to delay. These objectives were compared with the baseline considering the functions both individually and together. According to the results, the enhancement of the total fuel consumption due to delay and total delay duration are 17.3% and 3.2% compared to the baseline cases. When the two functions are considered together, 15.2% reduction in fuel consumption was obtained.