DocumentCode :
3226664
Title :
Implementation of class timetabling using multi agents
Author :
Nandhini, M. ; Kanmani, S.
Author_Institution :
Dept. of Comput. Sci., Tagore Arts Coll., Puducherry, India
fYear :
2009
fDate :
22-24 July 2009
Firstpage :
1
Lastpage :
2
Abstract :
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.
Keywords :
educational administrative data processing; minimisation; multi-agent systems; activitiy assignment; artificial intelligence domain; class timetabling; combination generator; graph coloring; heuristics; minfinder; minimum evaluation function value; multiagents; simulated annealing; steepest ascent hill climbing algorithm; tabu search; variable neighborhood search; Art; Artificial intelligence; Computer science; Educational institutions; Information technology; Simulated annealing; Multi Agent; combination; constraints; heuristic; hill climbing; optimal solution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Agent & Multi-Agent Systems, 2009. IAMA 2009. International Conference on
Conference_Location :
Chennai
Print_ISBN :
978-1-4244-4710-7
Type :
conf
DOI :
10.1109/IAMA.2009.5228065
Filename :
5228065
Link To Document :
بازگشت