A Comparison of GA-based Methods and Graph-ColouringMethods for solving the Timetabling ProblemHugo

Several approaches have been used to solve the timetabling problem. Among those approaches the Genetic Algorithms (GAs) and the conventional graph colouring algorithms are found. This article presents a comparison between the performance of GAs and the conventional algorithms for solving the problem when only edge constraints are considered. The work reported also presents results after comparing the pure genetic algorithm when using several variations in its parameters and other heuristics based on nding the clique of a graph. Finally, other types of constraints, speciically near-clash constraints, are considered in the conventional algorithm using a heuristic for solving the traveling salesman problem (TSP). The criteria for comparison used is the number of constraint checks done in each approach.