Optimizing highly constrained examination time tabling problems

In this paper an improvement of hybrid genetic algorithm has been described. The algorithm has been enhanced with local search operators which are based around heuristic timetabling framework. The population is seeded to produce a solution which cannot be outperformed by the heuristic method alone. A hybridization of (∝+) evolution strategies algorithm with local search operators is proposed to solve the problem. Mathematics Subject Classification 2000: 90C70, 90C99 General Terms: Genetic algorithm, local search, time tabling.