Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

How are university examinations scheduled?
http://bit.ly/1z0pG4s
I have published a few papers on Sports Scheduling.
http://bit.ly/gVaUqT

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Displaying BibTeX on web site

Publication(s)

A task based approach for a real-world commodity routing problem
http://bit.ly/1mlrzCS
A triple objective function with a Chebychev dynamic pick-and-place point specification approach to optimise the surface mount placement machine
http://bit.ly/fi7zmk
Choice Function and Random HyperHeuristics
http://bit.ly/e7QYog
Iterated Local Search vs. Hyper-heuristics: Towards General-Purpose Search Algorithms
http://bit.ly/gWFcuw

Graham Kendall: Details of Requested Publication


Citation

Kendall, G and Hussin, N. M. A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology. In Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling, pages 199-217, 2004.

A later version of this paper was published in the selected volume of papers from the conference


Abstract

In this paper we introduce, and solve, an examination timetabling problem at University Technology MARA (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses and offers 144 programs delivered by 18 faculties. We discuss their examination timetabling problem with respect to its size, complexity and constraints. We analyse and process their real world data, and produce solutions utilising a tabu search based hyper-heuristic framework. Since this is a new dataset and no solutions have been published in literature, we can only compare our results with an existing manual solution. We find that our solution is at least 80% better with respect to proximity cost. We also compare our approach against a benchmark dataset and show that our method can produce good quality results.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{km2004, author = {G. Kendall and N. {Mohd Hussin}},
title = {A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology},
booktitle = {Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling},
year = {2004},
editor = {E. Burke and M. Trick},
pages = {199--217},
month = {August 18-20 2004},
organization = {Pittsburgh, USA},
note = {A later version of this paper was published in the selected volume of papers from the conference},
abstract = {In this paper we introduce, and solve, an examination timetabling problem at University Technology MARA (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses and offers 144 programs delivered by 18 faculties. We discuss their examination timetabling problem with respect to its size, complexity and constraints. We analyse and process their real world data, and produce solutions utilising a tabu search based hyper-heuristic framework. Since this is a new dataset and no solutions have been published in literature, we can only compare our results with an existing manual solution. We find that our solution is at least 80% better with respect to proximity cost. We also compare our approach against a benchmark dataset and show that our method can produce good quality results.},
keywords = {examination timetabling, timetabling, tabu search, meta-heuristics, metaheuristics, hyper-heuristics, hyperheuristics},
owner = {gxk},
timestamp = {2011.01.01},
webpdf = {http://www.graham-kendall.com/papers/km2004.pdf} }