The aircrew rostering problem belongs to the class of NP-Hard combinatorial optimization problems. It consists on constructing individual rosters through the distribution of planned pairings among available crew members in airline industries. In that purpose, several approaches were proposed through adapting imposed constraints to both the requirements and the internal regulations of each airline company. This paper deals with balancing three main objective functions per flight crew member. These objectives are the amount of flight hours, the total layover of all the assigned rotations and the destinations' occurrences. To do so, a new multi-objective linear model is stated and an implementation of an adapted genetic algorithm is illustrated. Testing the algorithm on real-life data provided by the national Tunisian airline company TunisAir proved the efficiency of our approach.
['Chaima Boufaied', 'Raja Trabelsi', 'Hela Masri', 'Saoussen Krichen']
A construction of rotations-based rosters with a Genetic Algorithm