Examination timetabling using scatter search hyper-heuristic

Nasser R. Sabar, Masri Ayob

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

Hyper-heuristic can be defined as a "heuristics to choose heuristics" that intends to increase the level of generality in which optimization methodologies can operate. In this work, we propose a scatter search based hyper-heuristic (SS-HH) approach for solving examination timetabling problems. The scatter search operates at high level of abstraction which intelligently evolves a sequence of low level heuristics to use for a given problem. Each low level heuristic represents a single neighborhood structure. We test our proposed approach on the un-capacitated Carter benchmarks datasets. Experimental results show the proposed SS-HH is capable of producing good quality solutions which are comparable to other hyper-heuristics approaches (with regarding to Carter benchmark datasets).

Original languageEnglish
Title of host publication2009 2nd Conference on Data Mining and Optimization, DMO 2009
Pages127-131
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 2nd Conference on Data Mining and Optimization, DMO 2009 - Bangi, Selangor
Duration: 27 Oct 200928 Oct 2009

Other

Other2009 2nd Conference on Data Mining and Optimization, DMO 2009
CityBangi, Selangor
Period27/10/0928/10/09

Keywords

  • Educational timetabling
  • Hyper-heuristic
  • Scatter search

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Cite this

Sabar, N. R., & Ayob, M. (2009). Examination timetabling using scatter search hyper-heuristic. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009 (pp. 127-131). [5341899] https://doi.org/10.1109/DMO.2009.5341899

Examination timetabling using scatter search hyper-heuristic. / Sabar, Nasser R.; Ayob, Masri.

2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 127-131 5341899.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sabar, NR & Ayob, M 2009, Examination timetabling using scatter search hyper-heuristic. in 2009 2nd Conference on Data Mining and Optimization, DMO 2009., 5341899, pp. 127-131, 2009 2nd Conference on Data Mining and Optimization, DMO 2009, Bangi, Selangor, 27/10/09. https://doi.org/10.1109/DMO.2009.5341899
Sabar NR, Ayob M. Examination timetabling using scatter search hyper-heuristic. In 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. p. 127-131. 5341899 https://doi.org/10.1109/DMO.2009.5341899
Sabar, Nasser R. ; Ayob, Masri. / Examination timetabling using scatter search hyper-heuristic. 2009 2nd Conference on Data Mining and Optimization, DMO 2009. 2009. pp. 127-131
@inproceedings{f4fc2c94f5944b8ca4f14223d95568a3,
title = "Examination timetabling using scatter search hyper-heuristic",
abstract = "Hyper-heuristic can be defined as a {"}heuristics to choose heuristics{"} that intends to increase the level of generality in which optimization methodologies can operate. In this work, we propose a scatter search based hyper-heuristic (SS-HH) approach for solving examination timetabling problems. The scatter search operates at high level of abstraction which intelligently evolves a sequence of low level heuristics to use for a given problem. Each low level heuristic represents a single neighborhood structure. We test our proposed approach on the un-capacitated Carter benchmarks datasets. Experimental results show the proposed SS-HH is capable of producing good quality solutions which are comparable to other hyper-heuristics approaches (with regarding to Carter benchmark datasets).",
keywords = "Educational timetabling, Hyper-heuristic, Scatter search",
author = "Sabar, {Nasser R.} and Masri Ayob",
year = "2009",
doi = "10.1109/DMO.2009.5341899",
language = "English",
isbn = "9781424449446",
pages = "127--131",
booktitle = "2009 2nd Conference on Data Mining and Optimization, DMO 2009",

}

TY - GEN

T1 - Examination timetabling using scatter search hyper-heuristic

AU - Sabar, Nasser R.

AU - Ayob, Masri

PY - 2009

Y1 - 2009

N2 - Hyper-heuristic can be defined as a "heuristics to choose heuristics" that intends to increase the level of generality in which optimization methodologies can operate. In this work, we propose a scatter search based hyper-heuristic (SS-HH) approach for solving examination timetabling problems. The scatter search operates at high level of abstraction which intelligently evolves a sequence of low level heuristics to use for a given problem. Each low level heuristic represents a single neighborhood structure. We test our proposed approach on the un-capacitated Carter benchmarks datasets. Experimental results show the proposed SS-HH is capable of producing good quality solutions which are comparable to other hyper-heuristics approaches (with regarding to Carter benchmark datasets).

AB - Hyper-heuristic can be defined as a "heuristics to choose heuristics" that intends to increase the level of generality in which optimization methodologies can operate. In this work, we propose a scatter search based hyper-heuristic (SS-HH) approach for solving examination timetabling problems. The scatter search operates at high level of abstraction which intelligently evolves a sequence of low level heuristics to use for a given problem. Each low level heuristic represents a single neighborhood structure. We test our proposed approach on the un-capacitated Carter benchmarks datasets. Experimental results show the proposed SS-HH is capable of producing good quality solutions which are comparable to other hyper-heuristics approaches (with regarding to Carter benchmark datasets).

KW - Educational timetabling

KW - Hyper-heuristic

KW - Scatter search

UR - http://www.scopus.com/inward/record.url?scp=72449146243&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72449146243&partnerID=8YFLogxK

U2 - 10.1109/DMO.2009.5341899

DO - 10.1109/DMO.2009.5341899

M3 - Conference contribution

AN - SCOPUS:72449146243

SN - 9781424449446

SP - 127

EP - 131

BT - 2009 2nd Conference on Data Mining and Optimization, DMO 2009

ER -