|
计算机应用 2007
Solution to course scheduling problems based on genetic algorithm and tabu search
|
Abstract:
Course scheduling problem is a type of NP-hard problems.Usually,it can be solved by utilizing genetic algorithm.Tabu search algorithm was combined with genetic algorithm to improve the performance.Furthermore,by altering the individual fitness computation method,the curriculum schedule polarization phenomena can be avoided.Experimental results indicate that the method is feasible and has better performance.