Survey on University timetabling problem

The University course timetabling problem is confirmed to be an NP-Hard problem. It tackles the problem of assignment, set of course set of room in the given timeslot according to the given constraints. With the help of given constraints we assign the available resources. In this paper after a brief history account, we describe different types of timetabling problem and afterward describe some widely used methodologies to solve the timetabling problem like artificial ant colony(ACO), hybrid bee colony optimization method(HBC), PSO(particle swarm optimization), genetic algorithm etc.