Implementation of class timetabling using multi agents

Timetabling problem means assigning activities to time slots such that various constraints and restrictions are satisfied. In artificial intelligence domain, the techniques viz., graph coloring, hill climbing , tabu search, simulated annealing , variable neighborhood search etc., have been used in which searching is made faster by applying heuristics . In this paper, implementation of class timetabling with multi agents by steepest ascent hill climbing algorithm has been proposed. It uses agents namely, combination generator which generates the maximum possible combinations for the inputting timetable and minfinder which finds a combination with minimum evaluation function value for further successive examination . A improved heuristics is applied while generating timetables from random initial solution to the optimal solution to reach the goal at the earliest. Also, the architecture, operations and the interactions between multi agents while implementing class timetabling have been discussed.