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 football fixtures worked out?
http://bit.ly/1z0oTAH
How are university examinations scheduled?
http://bit.ly/1z0pG4s

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Vehicle Routing Datasets

Publication(s)

Population based Local Search for university course timetabling problems
http://bit.ly/1mlJLZj
Tabu assisted guided local search approaches for freight service network design
http://bit.ly/1mlrwTF
A honey-bee mating optimization algorithm for educational timetabling problems
http://bit.ly/1dhSqnm
Population based Local Search for university course timetabling problems
http://bit.ly/1mlJLZj

Graham Kendall: Details of Requested Publication


Citation

Sabar, N. R; Ayob, M; Kendall, G and Qu, R Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems. IEEE Transactions on Evolutionary Computation, 17 (6): 840-861, 2013.


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.1109/TEVC.2013.2281527 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.

2014 (3.654), 2013 (5.545), 2012 (4.810), 2011 (3.341), 2010 (4.403), 2009 (4.589), 2008 (3.736), 2007 (2.426), 2006 (3.770), 2005 (3.257), 2004 (3.688), 2003 (2.713), 2002 (1.486), 2001 (1.708)

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{sakq2013, author = {N. R. Sabar and M. Ayob and G. Kendall and R. Qu},
title = {Grammatical Evolution Hyper-Heuristic for Combinatorial Optimization Problems},
journal = {IEEE Transactions on Evolutionary Computation},
year = {2013},
volume = {17},
pages = {840--861},
number = {6},
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.1109/TEVC.2013.2281527},
issn = {1089-778X},
keywords = {Grammatical evolution, hyper-heuristics, timetabling, vehicle routing},
owner = {gxk},
timestamp = {2011.06.11},
webpdf = {http://www.graham-kendall.com/papers/sakq2013.pdf} }