Simulated annealing hyper-heuristic algorithm for TTP
摘要
The timetabling problem(TTP) is one of the most classical problems in the combinatorial optimization.Many heuristics and meta-heuristics have been developed for the TTP.An investigation of hyper-heuristic approach upon a set of widely used constructive heuristics(graph coloring heuristics) in timetabling is presented.Within the hyper-heuristic framework,a simulated annealing algorithm is employed on the high level and graph coloring heuristics which are used for constructing timetables are work on the low level.The ob-jective of the algorithm is to develop an approach which is more widely applicable fundamentally and general with a wider range of the combinatorial optimization problems.This algorithm is tested with real-word data and the result is satisfactory.