Solving a large-scale integrated fleet assignment and crew pairing problem

Name: Solving a large-scale integrated fleet assignment and crew pairing problem
Author: Özener, Okan Örsan, Örmeci Matoğlu, M., Erdoğan, G., Haouari, M., Sözer, Hasan

İsim	Solving a large-scale integrated fleet assignment and crew pairing problem
Yazar	Özener, Okan Örsan, Örmeci Matoğlu, M., Erdoğan, G., Haouari, M., Sözer, Hasan
Basım Tarihi:	2017
Basım Yeri	- Springer International Publishing
Konu	Fleet assignment, Crew pairing, Airline operations planning, Large-scale neighborhood search
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0254-5330
Kayıt Numarası	d76f3ab3-cb6a-4ff9-ab01-cf7e7350eb16
Lokasyon	Industrial Engineering, Computer Science
Tarih	2017
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	Airline schedule planning problems are typically decomposed into smaller problems, which are solved in a sequential manner, due to the complexity of the overall problems. This results in suboptimal solutions as well as feasibility issues in the consecutive phases. In this study, we address the integrated fleet assignment and crew pairing problem (IFACPP) of a European Airline. The specific network and cost structures allow us to develop novel approaches to this integrated problem. We propose an optimization-driven algorithm that can efficiently handle large scale instances of the IFACPP. We perform a computational study on real-world monthly flight schedules to test the performance of our solution method. Based on the results on instances with up to 27,500 flight legs, we show that our algorithm provides solutions with significant cost savings over the sequential approach.
DOI	10.1007/s10479-016-2319-9
Cilt	253

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Solving a large-scale integrated fleet assignment and crew pairing problem

Yazar Özener, Okan Örsan, Örmeci Matoğlu, M., Erdoğan, G., Haouari, M., Sözer, Hasan

Basım Tarihi 2017

Basım Yeri - Springer International Publishing

Konu Fleet assignment, Crew pairing, Airline operations planning, Large-scale neighborhood search

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0254-5330

Kayıt Numarası d76f3ab3-cb6a-4ff9-ab01-cf7e7350eb16

Lokasyon Industrial Engineering, Computer Science

Tarih 2017

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

Örnek Metin Airline schedule planning problems are typically decomposed into smaller problems, which are solved in a sequential manner, due to the complexity of the overall problems. This results in suboptimal solutions as well as feasibility issues in the consecutive phases. In this study, we address the integrated fleet assignment and crew pairing problem (IFACPP) of a European Airline. The specific network and cost structures allow us to develop novel approaches to this integrated problem. We propose an optimization-driven algorithm that can efficiently handle large scale instances of the IFACPP. We perform a computational study on real-world monthly flight schedules to test the performance of our solution method. Based on the results on instances with up to 27,500 flight legs, we show that our algorithm provides solutions with significant cost savings over the sequential approach.

DOI 10.1007/s10479-016-2319-9

Cilt 253