Solving examination timetabling problem within a hyperheuristic framework

Shinta Dewi, Raras Tyasnurita*, Febriyora Surya Pratiwi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

Scheduling exams in colleges are a complicated job that is difficult to solve conventionally. Exam timetabling is one of the combinatorial optimization problems where there is no exact algorithm that can answer the problem with the optimum solution and minimum time possible. This study investigated the University of Toronto benchmark dataset, which provides 13 real instances regarding the scheduling of course exams from various institutions. The hard constraints for not violate the number of time slots must be fulfilled while paying attention to fitness and running time. Algorithm of largest degree, hill climbing, and tabu search within a hyper-heuristic framework is investigated with regards to each performance. This study shows that the Tabu search algorithm produces much lower penalty value for all datasets by reducing 18-58% from the initial solution.

Original languageEnglish
Pages (from-to)1611-1620
Number of pages10
JournalBulletin of Electrical Engineering and Informatics
Volume10
Issue number3
DOIs
Publication statusPublished - 2021

Keywords

  • Examination timetabling
  • Hill climbing
  • Hyper-heuristic
  • Largest degree
  • Tabu search

Fingerprint

Dive into the research topics of 'Solving examination timetabling problem within a hyperheuristic framework'. Together they form a unique fingerprint.

Cite this