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

I have published a few papers on Sports Scheduling.
http://bit.ly/gVaUqT
Can ants play chess? Yes they can!
http://bit.ly/1yW3UhX

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Molecular Videos (Smelly)

Publication(s)

Iterated Local Search Using an Add and Delete Hyper-heuristic for University Course Timetabling
http://bit.ly/1mlRZo4
Chapter 1: Introduction
http://bit.ly/1tzAi1K
A Hybrid Evolutionary Approach to the Nurse Rostering Problem
http://bit.ly/ey147Y
Constructing Initial Neighbourhoods to Identify Critical Constraints
http://bit.ly/h3xfnd

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 Practice and Theory of Automated Timetabling V, pages 270-293, Springer, Lecture Notes in Computer Science 3616, 2005.

A previous version of this paper was published in the 2004 PATAT proceedings


Abstract

In this paper we introduce an examination timetabling problem from the MARA University of Technology (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses and offers 144 programmes, delivered by 18 faculties. This dataset differs from the others reported in the literature due to weekend constraints that have to be observed. We present their examination timetabling problem with respect to its size, complexity and constraints. We analyse their real-world data, and produce solutions utilising a tabu-search-based hyper-heuristic. Since this is a new dataset, and no solutions have been published in the 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 is able to produce good quality results.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1007/11593577_16 You can link directly to the original paper, via the doi, from here

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{km2005, 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 = {Practice and Theory of Automated Timetabling V},
year = {2005},
editor = {E. Burke and M. Trick},
volume = {3616},
series = {Lecture Notes in Computer Science},
pages = {270--293},
publisher = {Springer},
note = {A previous version of this paper was published in the 2004 PATAT proceedings},
abstract = {In this paper we introduce an examination timetabling problem from the MARA University of Technology (UiTM). UiTM is the largest university in Malaysia. It has 13 branch campuses and offers 144 programmes, delivered by 18 faculties. This dataset differs from the others reported in the literature due to weekend constraints that have to be observed. We present their examination timetabling problem with respect to its size, complexity and constraints. We analyse their real-world data, and produce solutions utilising a tabu-search-based hyper-heuristic. Since this is a new dataset, and no solutions have been published in the 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 is able to produce good quality results.},
doi = {10.1007/11593577_16},
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/km2005.pdf} }