Solving Airline Crew Recovery Problems by Identifying The Existence of Crew Swaps Khusnul Novianingsih
Mathematics Study Program, Universitas Pendidikan Indonesia
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 cancelling 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.
