In this paper, a Harmony Search-based Hyper-heuristic (HSHH) approach is proposed for tackling examination timetabling problems. In this approach, the harmony search algorithm will operate as a high level of abstraction which intelligently evolves a sequence of low level heuristics. This sequence is a combination of improvement heuristics which consist of neighborhood structure strategies. The proposed approach is tested using the examination timetabling tracks in Second International Timetabling Competition (ITC-2007) benchmarks. Experimentally, the HSHH approach can achieve comparable results with the comparative methods in the literature.
CITATION STYLE
Anwar, K., Khader, A. T., Al-Betar, M. A., & Awadallah, M. A. (2014). Development on harmony search hyper-heuristic framework for examination timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8795, pp. 87–95). Springer Verlag. https://doi.org/10.1007/978-3-319-11897-0_11
Mendeley helps you to discover research relevant for your work.