Solving Examination Timetabling Problem By Using Genetic Algorithm

Many researchers over the last decade have established numerous researches and used many methods to handle universities¿ final examination timetabling problem, such as simulated annealing, tabu search and genetic algorithms. In this Book, Genetic Algorithm (GA) is used to solve the College of Graduate Studies (CoGS) final examination timetabling problem as it is capable of solving many complex problems. This problem belongs to a class of scheduling problems which is highly constrained and known to be NP-hard. The algorithm has been adapted to solve the research problem whose procedure is different from the common algorithm. The Book attempts to find the best solution (best timetable) for CoGS to help UNITEN reduce time and effort for creating examination timetables. New approaches to some of the GAs operators are introduced. These operators include Adaptive Mutation operator that tackles the stasis problem and a crossover scheme called Scattered Crossover to enhance the GA¿s ability to produce better solutions with best fitness value in lesser generations.