https://orcid.org/0000-0001-9985-8354
https://orcid.org/0000-0001-7128-6913
https://orcid.org/0000-0002-9360-6882
https://orcid.org/0000-0001-9985-8354
https://orcid.org/0000-0001-7128-6913
https://orcid.org/0000-0002-9360-6882
The airline crew pairing (ACP) problem is one of the most challenging problems in airline operations. It aims to decide the optimal connections among pairs of flights assigned to flight crews. However, the number of connections grows exponentially with the increasing number of flights. Conventional approaches usually follow a two-stage method, i.e., divide-and-conquer. The flight sequences (pairings) spanning multiple days are firstly generated for each crew. Then, the best pairing set is chosen based on minimum operational costs. When the number of flights is large, it becomes too difficult to generate all feasible pairings and find the optimum. In order to solve large-scale ACP problems efficiently, we propose a novel iterative optimization framework based on monte carlo tree search (MCTS). Thus, the speed of pairing generation and solution accuracy can be improved. To evaluate the performance of the proposed method, we conduct experiments on different scales of real-world instances provided by airline companies. The empirical results show that the proposed approach is capable of producing high-quality solutions, especially in large-scale instances.
An MCTS-Based Solution Approach to Solve Large-Scale Airline Crew Pairing Problems
IEEE Transactions on Intelligent Transportation Systems ; 24 , 5 ; 5477-5488
2023-05-01
8161462 byte
Article (Journal)
Electronic Resource
English
On Large-Scale Airline Crew Pairing Generation
| IEEE | 2018
Robust Airline Crew Pairing: Move-up Crews
| British Library Online Contents | 2006
Robust Airline Crew Pairing: Move-up Crews
| Online Contents | 2006
Integrated Airline Crew Pairing and Crew Assignment by Dynamic Constraint Aggregation
| Online Contents | 2012