Solving a Large-Scale Integrated Fleet Assignment and Crew Pairing Problem

Okan Orsan Ozener, Melda Ormeci Matoglu, G Erdogan, Mohamed Haouari, Hasan Sozer

Research output: Contribution to journalArticle

6 Citations (Scopus)
193 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)477-500
JournalAnnals of Operations Research
Volume253
Issue number1
Early online date22 Sep 2016
DOIs
Publication statusPublished - 1 Jun 2017

Fingerprint Dive into the research topics of 'Solving a Large-Scale Integrated Fleet Assignment and Crew Pairing Problem'. Together they form a unique fingerprint.

  • Cite this