Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

A greedy gradient-simulated annealing selection hyper-heuristic

Kalender, Murat, Kheiri, Ahmed, Özcan, Ender and Burke, Edmund K. 2013. A greedy gradient-simulated annealing selection hyper-heuristic. Soft Computing 17 (12) , pp. 2279-2292. 10.1007/s00500-013-1096-5

[img]
Preview
PDF - Accepted Post-Print Version
Download (893kB) | Preview

Abstract

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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Additional Information: PDF uploaded in accordance with publisher's policies at http://www.sherpa.ac.uk/romeo/issn/1432-7643/ (30.6.16).
Publisher: Springer
ISSN: 1432-7643
Date of First Compliant Deposit: 30 June 2016
Last Modified: 07 Jul 2017 13:28
URI: http://orca.cf.ac.uk/id/eprint/85717

Citation Data

Cited 25 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics