Solving Airline Crew Scheduling Problems by Identifying the Existence of Crew Swaps

DOI

10.2991/978-2-38476-283-5_17How to use a DOI?

Keywords

Crew Recovery; Crew Swap; Flight Delay; Cycle

Abstract

We investigate a problem for solving airline crew recovery problem efficiently. We present a concept to identify the candidate crew swaps in the operation of airline crew schedules. We show that crew recovery problem can be solved by canceling disjoint cycles in crew routes. Moreover, candidate crew swaps can also be obtained by finding all possible crew routes that can be constructed from active flights. The existence of a directed cycle in crew networks will inform to us how to swap crew routes. Based on these properties, we propose an algorithm for swapping crew. The computational results show that the algorithm can be implemented to solve crew recovery problems in short period of time.

Copyright

© 2024 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Khusnul Novianingsih
PY  - 2024
DA  - 2024/09/03
TI  - Solving Airline Crew Scheduling Problems by Identifying the Existence of Crew Swaps
BT  - Proceedings of the  9th Mathematics, Science, and Computer Science Education International Seminar (MSCEIS 2023)
PB  - Atlantis Press
SP  - 168
EP  - 176
SN  - 2352-5398
UR  - https://doi.org/10.2991/978-2-38476-283-5_17
DO  - 10.2991/978-2-38476-283-5_17
ID  - Novianingsih2024
ER  -