Febriyora Surya Pratiwi
Institut Teknologi Sepuluh Nopember

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Solving examination timetabling problem within a hyper-heuristic framework Shinta Dewi; Raras Tyasnurita; Febriyora Surya Pratiwi
Bulletin of Electrical Engineering and Informatics Vol 10, No 3: June 2021
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v10i3.2996

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.