Air-Crew Scheduling In Transportation Problems: An Experiment Way to Apply Meta-heuristics Algorithms

Air–crew scheduling is classified into NP-hard problems, which has been a challenge for both planners and researchers. Meta-heuristics algorithms have been known as powerful ones to find out “high quality” alternatives. In this paper, a systematic way to construct and solve air-crew scheduling problems is presented. First of all, a set of possible pairings or tours are generated; consequently, a sub set of feasible tours are selected; finally, fleets are assigned to be responsible for them. Meta-heuristics algorithms, column selection in set partitioning algorithm or longest processing time, are used to prefer a sub-set of feasible parings. In addition, to assign fleets to undertake the tours, a greedy algorithm is used. Results can be used as an initial, feasible, and good solution. It is a foundation to help managers adjust and refine to satisfy requirements of the problem.