Solutions of timetable design

Abstract

Timetable design has been an intensively researched topic for decades and since it belongs to the topic of NP-complete tasks, heuristic procedures are required to solve it. In this article I will outline those optimalizational excersises, which need to solve to generate high school timetable. Metaheuristic algorithms (for example genetic algorithm) are usable solutions, but it's deserving to reduce the original 4-factored problem to simplier, 2-factored and 3-factored problems before that. Those are solvable with conventional optimalizational methods and make up together the solution of 4-factored problem. The results what we get so, give us strong points about metaheuristics and we can determine, is metaheuristic algorithms are the best ways, we can apply or not.