Universal Method for Timetable Construction based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming
to solve. Most of the methods of solving them concern
only one problem instance or class. This paper describes a universal
method for solving large, highly constrained timetabling problems
from different domains. The solution is based on evolutionary
algorithm-s framework and operates on two levels – first-level
evolutionary algorithm tries to find a solution basing on given set of
operating parameters, second-level algorithm is used to establish
those parameters. Tabu search is employed to speed up the solution
finding process on first level. The method has been used to solve
three different timetabling problems with promising results.
Evolutionary algorithms, tabu search, timetabling.