an integrated crew scheduling problem considering reserve crew in air transportation: ant colony optimization algorithm

A crew scheduling problem (csp) is a highly complex airline optimization problem, which includes two sub-problems, namely crew rostering problem (crp) and crew pairing problem (cpp). solving these problems sequentially may not lead to an optimal solution. to overcome this shortcoming, the present study introduces a new bi-objective formulation for the integrating cpp and crp by considering the reserve crew with the objectives of crew cost minimization and crew reserve maximization. the integrated model generates and assigns pairings to a group of crew members by taking into account the rules and regulations about employing the manpower (i.e., crew member) and crew reservation in order to reduce flight delays or even cancellations due to the unexpected disruptions. an ant colony optimization (aco) algorithm is used to solve the considered problem. to justify the efficiency of this proposed algorithm in solving the presented model, different test problems are generated and solved by aco and gams. the computational results indicate that solutions obtained by the proposed aco algorithm have a 2.57% gap with the optimal solutions reported by gams as optimization software on average and significantly less cpu time for small-sized problems. also, aco obtains better solutions in significantly shorter cpu time for large-sized problems. the results indicate the efficient performance of the proposed algorithm in solving the given problems.