Cockpit crew pairing Pareto optimisation in a budget airline

A B S T R A C T Crew pairing is the primary cost checkpoint in airline crew scheduling. Because the crew cost comes second after the fuel cost, a substantial cost saving can be gained from effective crew pairing. In this paper, the cockpit crew pairing problem (CCPP) of a budget airline was studied. Unlike the conventional CCPP that focuses solely on the cost component, many more objectives deemed to be no less important than cost minimisation were also taken into consideration. The adaptive non dominated sorting differential algorithm III (ANSDE III) was proposed to optimise the CCPP against many objectives simultaneously. The performance of ANSDE III was compared against the NSGA III, MOEA/D, and MODE algorithms under several Pareto optimal measurements, where ANSDE III outperformed the others in every metric. (c) 2022 by the authors; licensee Growing Science, Canada

Automated summary

This paper studies the cockpit crew pairing problem of a budget airline and proposes the adaptive non-dominated sorting differential algorithm III to optimize multiple objectives simultaneously. The study finds that the algorithm outperforms others in all metrics.