Home > Research > Publications & Outputs > A greedy gradient-simulated annealing selection...

Electronic data

  • SoftComputing2013

    Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s00500-013-1096-5

    Accepted author manuscript, 872 KB, PDF-document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License


Text available via DOI:

View graph of relations

A greedy gradient-simulated annealing selection hyper-heuristic

Research output: Contribution to journalJournal article

<mark>Journal publication date</mark>1/12/2013
<mark>Journal</mark>Soft Computing
Issue number12
Number of pages14
Pages (from-to)2279-2292
Publication statusPublished
Early online date31/07/13
Original languageEnglish


Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/10.1007/s00500-013-1096-5