Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling

Application of Heuristic Combinations within a Hyper-Heuristic Framework for Exam Timetabling

Examination Timetabling Problem is one of the optimization and combinatorial problems. It is proved to be a non-deterministic polynomial (NP)-hard problem. On a large scale of data, the examination timetabling problem becomes a complex problem and takes time if it solved manually. Therefore, heurist...

Full description

Bibliographic Details
Main Authors: Gabriella Icasia, Raras Tyasnurita, Etria Sepwardhani Purba
Format: Article
Language:English
Published: Ikatan Ahli Informatika Indonesia 2020-08-01
Series:Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Subjects:
: examination timetabling problem, toronto dataset, hill-climbing algorithm, tabu search algorithm, hyper-heuristics
Online Access:http://jurnal.iaii.or.id/index.php/RESTI/article/view/2066

Similar Items

Similar Items