A WORKLOAD-BALANCE CROSSOVER OPERATION IN A GENETIC ALGORITHM FOR SOLVING AN AIRLINE CREW ROSTERING PROBLEM

The Airline Crew Scheduling Problem (ACSP) a large-scaled and complex optimization problem that assigns crew members to the flight duties while satisfying agreements with the labour union and other requirements. The ACSP is divided into two stages; Crew Pairing Problem which consists on finding a sequences of flights, starting and ending at a crew base, and Crew Rostering Problem which assigns the pairings to individual crew member. The nominal Crew Rostering Problem considers operations costs are minimized. This paper proposed the bi-criterion mathematical formulation for Crew Rostering Problem which takes the crew satisfaction as the main concern. A genetic algorithms technique is proposed to produce balanced per-diem and workload solutions with acceptable deviation for the crew staff. The proposed approach is evaluated on a data from Thai Airways.