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 to teach Deep Blue to play poker and deliver groceries
http://bit.ly/1DXGeZD
Does AI have a place in the board room?
http://bit.ly/1DXreuW

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Google Scholar

Publication(s)

Constructing Initial Neighbourhoods to Identify Critical Constraints
http://bit.ly/h3xfnd
Searching the Hyper-heuristic Design Space
http://bit.ly/1sD4RoY
Aircraft Landing Problem using Hybrid Differential Evolution and Simple Descent Algorithm
http://bit.ly/1kqnagr
Alternative hyper-heuristic strategies for multi-method global optimization
http://bit.ly/g1xcMp

Graham Kendall: Details of Requested Publication


Citation

Sabar, N. R; Ayob, M; Qu, R and Kendall, G A Graph Coloring Constructive Hyper-Heuristic for Examination Timetabling Problems. Applied Intelligence, 37 (1): 1-11, 2012.


Abstract

In this work we investigate a new graph coloring constructive hyper-heuristic approach for solving examination timetabling problems. We utilize the hierarchical hybridizations of four low level graph coloring heuristics, these being largest degree, least saturation degree, largest colored degree and largest enrolment. These are hybridized to produce four ordered lists. For each list, the difficulty index of scheduling the first exam is calculated by considering its order in all lists to obtain a combined evaluation of its difficulty. The most difficult exam to be schedule is scheduled first (i.e. the one with the minimum difficulty index). To improve the effectiveness of timeslot selection, a roulette wheel selection mechanism is included in the algorithm to probabilistically select an appropriate timeslot for the chosen exam. We test our proposed approach on the most widely used un-capacitated Carter benchmarks and also on the recently introduced examination timetable dataset from the 2007 International Timetabling Competition. Compared against other methodologies, our results demonstrate that the graph coloring constructive hyper-heuristic produces good results and outperforms other approaches on some of the benchmark instances.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1007/s10489-011-0309-9 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


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2012 (1.853), 2011 (0.849), 2010 (0.881), 2009 (0.988), 2008 (0.775), 2007 (0.500), 2006 (0.329), 2005 (0.569), 2004 (0.477), 2003 (0.776), 2002 (0.686), 2001 (0.493), 2000 (0.420)

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

@ARTICLE{saqk2012, author = {N. R. Sabar and M. Ayob and R. Qu and G. Kendall},
title = {A Graph Coloring Constructive Hyper-Heuristic for Examination Timetabling Problems},
journal = {Applied Intelligence},
year = {2012},
volume = {37},
pages = {1--11},
number = {1},
abstract = {In this work we investigate a new graph coloring constructive hyper-heuristic approach for solving examination timetabling problems. We utilize the hierarchical hybridizations of four low level graph coloring heuristics, these being largest degree, least saturation degree, largest colored degree and largest enrolment. These are hybridized to produce four ordered lists. For each list, the difficulty index of scheduling the first exam is calculated by considering its order in all lists to obtain a combined evaluation of its difficulty. The most difficult exam to be schedule is scheduled first (i.e. the one with the minimum difficulty index). To improve the effectiveness of timeslot selection, a roulette wheel selection mechanism is included in the algorithm to probabilistically select an appropriate timeslot for the chosen exam. We test our proposed approach on the most widely used un-capacitated Carter benchmarks and also on the recently introduced examination timetable dataset from the 2007 International Timetabling Competition. Compared against other methodologies, our results demonstrate that the graph coloring constructive hyper-heuristic produces good results and outperforms other approaches on some of the benchmark instances.},
doi = {10.1007/s10489-011-0309-9},
issn = {0924-669X},
keywords = {timetbaling, hyper-heuristic, hyperheuristic, graph colouring, graph coloring, Carter datasets, ITC dataset},
owner = {gxk},
timestamp = {2011.06.11},
webpdf = {http://www.graham-kendall.com/papers/saqk2012.pdf} }