Meta-Heuristic Solver with Parallel Genetic Algorithm Framework in Airline Crew Scheduling

Airline crew scheduling is a very important part of the operational planning of commercial airlines, but it is a linear integer programming problem with multi-constraints. Traditionally, the airline crew scheduling problem is determined by solving the crew pairing problem (CPP) and the crew rostering problem (CRP), sequentially. In this paper, we propose a new heuristic solver based on the parallel genetic algorithm and an innovative crew scheduling algorithm, which improves traditional crew scheduling by integrating CPP and CRP into a single problem. The innovative scheduling method includes a global heuristic search and an adjustment for flights and crew so as to realize crew scheduling. The parallel genetic algorithm is used to divide the population into multiple threads for parallel calculation and to optimize the randomly generated flight sequence to maximize the number of flights that meet the crew configuration. Compared with the genetic algorithm, CPLEX and Gurobi, it shows high optimization efficiency, with a time reduction of 16.57-85.82%. The experiment shows that our crew utilization ratio is higher than that for traditional solvers, achieving almost 44 flights per month, with good scalability and stability in both 206 and 13,954 flight datasets, and can better manage airline crew scheduling in times of crew scarcity.