Novel search space updating heuristics-based genetic algorithm for optimizing medium-scale airline crew pairing problems

Demirel N., Deveci M.

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, cilt.10, sa.1, ss.1082-1101, 2017 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 10 Sayı: 1
  • Basım Tarihi: 2017
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1082-1101
  • Yıldız Teknik Üniversitesi Adresli: Evet

Özet

This study examines the crew pairing problem, which is one of the most comprehensive problems encountered in airline planning, to generate a set of crew pairings that has minimal cost, covers all flight legs and fulfils legal criteria. In addition, this study examines current research related to crew pairing optimization. The contribution of this study is developing heuristics based on an improved dynamic-based genetic algorithm, a deadhead-minimizing pairing search and a partial solution approach (less-costly alternative pairing search). This study proposes genetic algorithm variants and a memetic algorithm approach. In addition, computational results based on real-world data from a local airline company in Turkey are presented. The results demonstrate that the proposed approach can successfully handle medium sets of crew pairings and generate higher-quality solutions than previous methods.