Yazar
Zeghal, F. M., Haouari, Mohamed, Sherali, H. D., Aissaoui, N.
Basım Tarihi
2011-02
Basım Yeri
-
Palgrave Macmillan
Konu
OR in airlines, Airline fleet assignment, Aircraft routing, Flexible fleet, Flexible flight schedule, Column generation
Tür
Süreli Yayın
Dil
İngilizce
Dijital
Evet
Yazma
Hayır
Kütüphane
Özyeğin Üniversitesi
Demirbaş Numarası
0160-5682
Kayıt Numarası
befa362c-edfb-454c-8988-730a9718a783
Lokasyon
Industrial Engineering
Tarih
2011-02
Notlar
NSF
Örnek Metin
This paper addresses a Flexible Aircraft Fleeting and Routing Problem, which is motivated by the Tunisian national carrier TunisAir. A solution to this problem specifies the departure time of each flight, the subset of aircraft to be chartered or rented out, the individual aircraft assigned to each flight, as well as the sequence of flights to be flown by each aircraft. The objective is to maximize the expected total net profit, while satisfying activity constraints and long-term maintenance requirements. Tailored optimization-based heuristics are developed for solving this complex integrated problem. Computational experiments conducted on real data demonstrate that the proposed procedures are effective and robust, and significantly improve upon TunisAir's solutions.
DOI
10.1057/jors.2010.100
Cilt
62
