Comparing programming model with genetic algorithm model to the aircrew problem

With the rapid development of air transportation industry, the efficient arrangement scheme of the aircrew problem is becoming more and more important. This paper solves the aircrew problem by 0-1 integer programming model and genetic algorithm model. Especially it puts forward the suitable genetic operations to solve the the problem of group cross, group mutation and evolutionary cycle. In addition, according to different sizes of personnel issues, we set up the above two models and solve the models respectively by Lingo and Matlab programming. According to the analysis, we find that it is high efficiency to use integer programming to solve small personnel problem, and can find the global optimal solution in a short period of time, but it takes much time when faced with massive problems. However the calculated time does not significantly increase with the increasing scale of problem by the genetic algorithm, which explains the genetic algorithm has high efficiency for this problem, especially in solving large-scale of the aircrew problems.