A Study And Application Of Genetic Algorithms In The Crew Scheduling

Crew Scheduling is a classic problem in the area of Scheduling, It is a NP-hard problem. Currently, there are two popular solutions to solve People Scheduling: the first one is Optimal Solution Algorithm ,that is based on the limitation of the current solution, find a best solution in the solution space. The shortcoming of this algorithm is that it is time consuming; the second solution is Heutistic Solution Methods. The genetic algorithm is one of Heutistic Solution Methods. Genetic algorithm is a kind of random searching method using lives' natural selection and genetic mechanism. Its application predominance lies in complicated and non-linear problems, which are difficult for traditional searching methods.The reason of selecting genetic algorithm is that it can search a big solution space in the parallel mechanism. But with the limitation of the algorithm, this result is also not very satisfactory. Based on the global searching method of classic genetic algorithm (GA), and using the diversity preservation strategy of antibodies in biology immunity mechanism, the method greatly improves the colony diversity of GA and has better global searching capability. In this paper, we use this algorithm to solve the problem and find it a better way to solve this problem through experiments.