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.

关键词： Scheduling problem Time table problem Genetic algorithm Genetic search algorithm

作者: DONG YUNFENG GAO WUSHI QI BEI

作者单位: computer center,SHANDONG POLYTECHNIC UNIVERSITY,CHINA network center,SHANDONG POLYTECHNIC UNIVERSITY,CHINA

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer Technology and Development(2011第三届计算机技术与发展国际会议 ICCTD2011)

会议地点: 成都

会议语种:英文

页码: 243-247

在线出版日期: 2011-11-25（万方平台首次上网日期，不代表论文的发表时间）