FES

Final exam scheduler - FES. 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.


References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Mutingi, Michael; Mbohwa, Charles: Grouping genetic algorithms. Advances and applications (2017)
  2. Abdul-Rahman, Syariza; Burke, Edmund K.; Bargiela, Andrzej; McCollum, Barry; Özcan, Ender: A constructive approach to examination timetabling based on adaptive decomposition and ordering (2014)
  3. Kalender, Murat; Kheiri, Ahmed; Özcan, Ender; Burke, Edmund K.: A greedy gradient-simulated annealing selection hyper-heuristic (2013) ioport
  4. Burke, Edmund K.; Kendall, Graham; Mustafa, Mısır; Özcan, Ender: Monte Carlo hyper-heuristics for examination timetabling (2012)
  5. Özcan, Ender; Parkes, Andrew J.; Alkan, Alpay: The interleaved constructive memetic algorithm and its application to timetabling (2012) ioport