Title :
Final exam scheduler - FES
Author :
Özcan, Ender ; Ersoy, Ersan
Author_Institution :
Dept. of Comput. Eng., Yeditepe Univ., Istanbul, Turkey
Abstract :
Timetabling problems are constraint optimization problems proven to be NP-complete. Furthermore, evaluation of violations is costly, and there is no common data format for representing timetabling problem instances. In this paper, a framework for designing memetic algorithms (MAs) to solve timetabling problems is described and a tool, named final exam scheduler (FES) is introduced. FES is the first tool that accepts timetabling markup language (TTML) documents as input. It utilizes an MA with an adaptive violation directed hierarchical hill climbing method for solving examination timetabling problem instances. Experimental results on a set of benchmark data indicate the success of MA.
Keywords :
computational complexity; constraint theory; education; evolutionary computation; optimisation; scheduling; NP-complete problem; adaptive violation directed hierarchical hill climbing method; constraint optimization problem; examination timetabling problem; final exam scheduler; memetic algorithm; timetabling markup language documents; Algorithm design and analysis; Computational modeling; Genetic mutations; Markup languages; Processor scheduling; Scheduling algorithm; Simulated annealing; Standards development; Unified modeling language; XML;
Conference_Titel :
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Print_ISBN :
0-7803-9363-5
DOI :
10.1109/CEC.2005.1554848
