Solving a large-scale crew pairing problem

Name: Solving a large-scale crew pairing problem
Author: Erdoğan, G., Haouari, M., Matoglu, M. Ö., Özener, Okan Örsan

İsim	Solving a large-scale crew pairing problem
Yazar	Erdoğan, G., Haouari, M., Matoglu, M. Ö., Özener, Okan Örsan
Basım Tarihi:	2015
Basım Yeri	- Palgrave Macmillan
Konu	Crew pairing problem, Metaheuristic, Set partitioning, Monthly problem
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	1476-9360
Kayıt Numarası	ddf08be1-e168-4c0f-b1e4-476109ece9bf
Lokasyon	Industrial Engineering
Tarih	2015
Notlar	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Örnek Metin	Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on the CPP of North American airlines, which widely differs from that of most European airline companies in terms of the objective function, the flight structure, and the planning horizon. In this study, we develop an optimizationdriven heuristic algorithm that can efficiently handle large-scale instances of the CPP that must be solved on a monthly basis. We perform computational experiments using flight schedules of an European airline company to test the performance of the solution method. Our computational results demonstrate that our algorithm is able to provide high-quality solutions to monthly instances with up to 27 000 flight legs.
DOI	10.1057/jors.2015.2
Cilt	66

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Solving a large-scale crew pairing problem

Yazar Erdoğan, G., Haouari, M., Matoglu, M. Ö., Özener, Okan Örsan

Basım Tarihi 2015

Basım Yeri - Palgrave Macmillan

Konu Crew pairing problem, Metaheuristic, Set partitioning, Monthly problem

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 1476-9360

Kayıt Numarası ddf08be1-e168-4c0f-b1e4-476109ece9bf

Lokasyon Industrial Engineering

Tarih 2015

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

Örnek Metin Airline companies seek to solve the problem of determining an assignment of crews to a pre-determined flight schedule with minimum total cost, called the Crew Pairing Problem (CPP). Most of the existing studies focus on the CPP of North American airlines, which widely differs from that of most European airline companies in terms of the objective function, the flight structure, and the planning horizon. In this study, we develop an optimizationdriven heuristic algorithm that can efficiently handle large-scale instances of the CPP that must be solved on a monthly basis. We perform computational experiments using flight schedules of an European airline company to test the performance of the solution method. Our computational results demonstrate that our algorithm is able to provide high-quality solutions to monthly instances with up to 27 000 flight legs.

DOI 10.1057/jors.2015.2

Cilt 66