43 A New TTP Algorithm Based on Genetic Algorithm and Evaluation

The scheduling problem is a typical time table problem in educational administration. For such a NP complete problems, when the genetic algorithm solves this problem, it has precociousness phenomenon and quickly converges not to the global optimal solution but to the local optimal solution. Therefore, we use the advantage of local search method and partial matching crossover operation to solve TTP problem with the genetic algorithm combining search algorithm. We do a lot of experiments and evaluate the performance of the improved genetic algorithm. The experiment results show that genetic search algorithm is a more superior algorithm to apply to the TTP problem.