Intelligent Timetable Scheduler: A Comparison of Genetic, Graph Coloring, Heuristic and Iterated Local Search Algorithms

A Timetable scheduling is a monotonous task and a problem in an educational institute. This is because many rules and constraints are involved, which can be categorized as hard and soft constraints. Mainly, a university must produce two types of timetables, which are examination, and semester timetables. This paper has reviewed the Exam Timetabling problem with Genetic and Graph Coloring algorithms and the Semester Timetabling problem with Heuristic and Iterated Local Search algorithms. Our aim here is to develop a possible and correct solution for each timetabling problem using the above-mentioned four different approaches.