Exact approaches for integrated aircraft fleeting and routing at TunisAir

Name: Exact approaches for integrated aircraft fleeting and routing at TunisAir
Author: Haouari, Mohamed, Sherali, H. D., Mansour, F. Z., Aissaoui, N.

İsim	Exact approaches for integrated aircraft fleeting and routing at TunisAir
Yazar	Haouari, Mohamed, Sherali, H. D., Mansour, F. Z., Aissaoui, N.
Basım Tarihi:	2011-06
Basım Yeri	- Science+Business Media
Konu	OR in airlines, Airline fleet assignment, Aircraft routing, Benders decomposition, Branch-and-bound, Column generation, Branch-and-price
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0926-6003
Kayıt Numarası	243165f2-05aa-4524-86ed-9edc82fa72f1
Lokasyon	Industrial Engineering
Tarih	2011-06
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost route assignment for each aircraft so as to cover each flight by exactly one aircraft while satisfying maintenanceactivity constraints. We investigate two tailored approaches for this problem: Benders decomposition and branch-and-price. Computational experiments conducted on real-data provide evidence that the branch-and-price approach outperforms the Benders decomposition approach and delivers optimal solutions within moderate CPUtimes. On the other hand, the Benders algorithm yields very quickly high quality near-optimal solutions.
DOI	10.1007/s10589-009-9292-z
Cilt	49

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Exact approaches for integrated aircraft fleeting and routing at TunisAir

Yazar Haouari, Mohamed, Sherali, H. D., Mansour, F. Z., Aissaoui, N.

Basım Tarihi 2011-06

Basım Yeri - Science+Business Media

Konu OR in airlines, Airline fleet assignment, Aircraft routing, Benders decomposition, Branch-and-bound, Column generation, Branch-and-price

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0926-6003

Kayıt Numarası 243165f2-05aa-4524-86ed-9edc82fa72f1

Lokasyon Industrial Engineering

Tarih 2011-06

Notlar Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Örnek Metin We describe models and exact solutions approaches for an integrated aircraft fleeting and routing problem arising at TunisAir. Given a schedule of flights to be flown, the problem consists of determining a minimum cost route assignment for each aircraft so as to cover each flight by exactly one aircraft while satisfying maintenanceactivity constraints. We investigate two tailored approaches for this problem: Benders decomposition and branch-and-price. Computational experiments conducted on real-data provide evidence that the branch-and-price approach outperforms the Benders decomposition approach and delivers optimal solutions within moderate CPUtimes. On the other hand, the Benders algorithm yields very quickly high quality near-optimal solutions.

DOI 10.1007/s10589-009-9292-z

Cilt 49