Evolutionary algorithms for solving the airline crew pairing problem

Deveci M., Demirel N.

COMPUTERS & INDUSTRIAL ENGINEERING, cilt.115, ss.389-406, 2018 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 115
  • Basım Tarihi: 2018
  • Doi Numarası: 10.1016/j.cie.2017.11.022
  • Dergi Adı: COMPUTERS & INDUSTRIAL ENGINEERING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.389-406
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

Solving the airline crew pairing problem (CPP) requires a search to generate a set of minimum-cost crew pairings covering all flight legs, subject to a set of constraints. We propose a solution comprising two consecutive stages: crew pairing generation, followed by an optimisation stage. First, all legal crew pairings are generated with the given flights, and then the best subset of those pairings with minimal cost are chosen via an optimisation, process based on an evolutionary algorithm. This paper investigates the performance of two previously proposed genetic algorithm (GA) variants, and a memetic algorithm (MA) hybridising GA with hill climbing, for solving the CPP. The empirical results across a set of benchmark real-world instances illustrate that the proposed MA is the best performing approach overall.