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...

Descripció completa

Dades bibliogràfiques

Autors principals:	Gabriella Icasia, Raras Tyasnurita, Etria Sepwardhani Purba
Format:	Artigo
Idioma:	Inglês
Publicat:	Ikatan Ahli Informatika Indonesia 2020-08-01
Col·lecció:	Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi)
Matèries:	: examination timetabling problem, toronto dataset, hill-climbing algorithm, tabu search algorithm, hyper-heuristics
Accés en línia:	http://jurnal.iaii.or.id/index.php/RESTI/article/view/2066
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!