Tabu exponential monte-carlo with counter heuristic for examination timetabling

Nasser R. Sabar, Masri Ayob, Graham Kendall

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

15 Citations (Scopus)

Abstract

In this work, we introduce a new heuristic TEMCQ (Tabu Exponential Monte-Carlo with Counter) for solving exam timetabling problems. This work, an extension of the EMCQ (Exponential Monte-Carlo with Counter) heuristic that was originally introduced by Ayob and Kendall. EMCQ accepts an improved solution but intelligently accepts worse solutions depending on the solution quality, search time and the number of consecutive non-improving iterations. In order to enhance the EMCQ heuristic, we hybridise it with tabu search, in which the accepted moves are kept in a tabu list for a certain number of iterations in order to avoid cyclic moves. In this work, we test TEMCQ on the un-capacitated Carter's benchmark examination timetable dataset and evaluate the heuristic performance using standard proximity cost. We compare our results against other methodologies that have been reported in the literature over recent years. Results demonstrate that TEMCQ produces good results and outperforms other approaches on several benchmark instances.

Original languageEnglish
Title of host publication2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings
Pages90-94
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Nashville, TN
Duration: 30 Mar 20092 Apr 2009

Other

Other2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009
CityNashville, TN
Period30/3/092/4/09

Fingerprint

Tabu search
Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this

Sabar, N. R., Ayob, M., & Kendall, G. (2009). Tabu exponential monte-carlo with counter heuristic for examination timetabling. In 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings (pp. 90-94). [4927020] https://doi.org/10.1109/SCIS.2009.4927020

Tabu exponential monte-carlo with counter heuristic for examination timetabling. / Sabar, Nasser R.; Ayob, Masri; Kendall, Graham.

2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings. 2009. p. 90-94 4927020.

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

Sabar, NR, Ayob, M & Kendall, G 2009, Tabu exponential monte-carlo with counter heuristic for examination timetabling. in 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings., 4927020, pp. 90-94, 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009, Nashville, TN, 30/3/09. https://doi.org/10.1109/SCIS.2009.4927020
Sabar NR, Ayob M, Kendall G. Tabu exponential monte-carlo with counter heuristic for examination timetabling. In 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings. 2009. p. 90-94. 4927020 https://doi.org/10.1109/SCIS.2009.4927020
Sabar, Nasser R. ; Ayob, Masri ; Kendall, Graham. / Tabu exponential monte-carlo with counter heuristic for examination timetabling. 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings. 2009. pp. 90-94
@inproceedings{1cfbdd5889964275845b3b82311bb0a5,
title = "Tabu exponential monte-carlo with counter heuristic for examination timetabling",
abstract = "In this work, we introduce a new heuristic TEMCQ (Tabu Exponential Monte-Carlo with Counter) for solving exam timetabling problems. This work, an extension of the EMCQ (Exponential Monte-Carlo with Counter) heuristic that was originally introduced by Ayob and Kendall. EMCQ accepts an improved solution but intelligently accepts worse solutions depending on the solution quality, search time and the number of consecutive non-improving iterations. In order to enhance the EMCQ heuristic, we hybridise it with tabu search, in which the accepted moves are kept in a tabu list for a certain number of iterations in order to avoid cyclic moves. In this work, we test TEMCQ on the un-capacitated Carter's benchmark examination timetable dataset and evaluate the heuristic performance using standard proximity cost. We compare our results against other methodologies that have been reported in the literature over recent years. Results demonstrate that TEMCQ produces good results and outperforms other approaches on several benchmark instances.",
author = "Sabar, {Nasser R.} and Masri Ayob and Graham Kendall",
year = "2009",
doi = "10.1109/SCIS.2009.4927020",
language = "English",
isbn = "9781424427574",
pages = "90--94",
booktitle = "2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings",

}

TY - GEN

T1 - Tabu exponential monte-carlo with counter heuristic for examination timetabling

AU - Sabar, Nasser R.

AU - Ayob, Masri

AU - Kendall, Graham

PY - 2009

Y1 - 2009

N2 - In this work, we introduce a new heuristic TEMCQ (Tabu Exponential Monte-Carlo with Counter) for solving exam timetabling problems. This work, an extension of the EMCQ (Exponential Monte-Carlo with Counter) heuristic that was originally introduced by Ayob and Kendall. EMCQ accepts an improved solution but intelligently accepts worse solutions depending on the solution quality, search time and the number of consecutive non-improving iterations. In order to enhance the EMCQ heuristic, we hybridise it with tabu search, in which the accepted moves are kept in a tabu list for a certain number of iterations in order to avoid cyclic moves. In this work, we test TEMCQ on the un-capacitated Carter's benchmark examination timetable dataset and evaluate the heuristic performance using standard proximity cost. We compare our results against other methodologies that have been reported in the literature over recent years. Results demonstrate that TEMCQ produces good results and outperforms other approaches on several benchmark instances.

AB - In this work, we introduce a new heuristic TEMCQ (Tabu Exponential Monte-Carlo with Counter) for solving exam timetabling problems. This work, an extension of the EMCQ (Exponential Monte-Carlo with Counter) heuristic that was originally introduced by Ayob and Kendall. EMCQ accepts an improved solution but intelligently accepts worse solutions depending on the solution quality, search time and the number of consecutive non-improving iterations. In order to enhance the EMCQ heuristic, we hybridise it with tabu search, in which the accepted moves are kept in a tabu list for a certain number of iterations in order to avoid cyclic moves. In this work, we test TEMCQ on the un-capacitated Carter's benchmark examination timetable dataset and evaluate the heuristic performance using standard proximity cost. We compare our results against other methodologies that have been reported in the literature over recent years. Results demonstrate that TEMCQ produces good results and outperforms other approaches on several benchmark instances.

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

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

U2 - 10.1109/SCIS.2009.4927020

DO - 10.1109/SCIS.2009.4927020

M3 - Conference contribution

SN - 9781424427574

SP - 90

EP - 94

BT - 2009 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2009 - Proceedings

ER -