Novel search space updating heuristics-based genetic algorithm for optimizing medium-scale airline crew pairing problems
- 10.2991/ijcis.2017.10.1.72How to use a DOI?
- Airline crew scheduling; Crew pairing; Set-covering; Genetic algorithm; Heuristics
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.
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - Nihan Çetin Demirel AU - Muhammet Deveci PY - 2017 DA - 2017/07/20 TI - Novel search space updating heuristics-based genetic algorithm for optimizing medium-scale airline crew pairing problems JO - International Journal of Computational Intelligence Systems SP - 1082 EP - 1101 VL - 10 IS - 1 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.2017.10.1.72 DO - 10.2991/ijcis.2017.10.1.72 ID - Demirel2017 ER -