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

The 2009 IEEE Symposium on Computational Intelligence and Games: Report

Publication(s)

A Tabu-Search Hyperheuristic for Timetabling and Rostering
http://bit.ly/i7823Y
Introducing a round robin tournament into Blondie24
http://bit.ly/f4DBrz
An evaluation of UK risky money: an artificial intelligence approach
http://bit.ly/idh7zY
A New Dynamic Point Specification Approach to Optimise Surface Mount Placement Machine in Printed Circuit Board Assembly
http://bit.ly/hWCyZA

Graham Kendall: Details of Requested Publication


Citation

Cowling, P; Kendall, G and Soubeiga, E A Hyperheuristic Approach to Scheduling a Sales Summit. In Selected papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2001), pages 176-190, Springer, Lecture Notes in Computer Science 2079, 2001.


Abstract

The concept of a hyperheuristic is introduced as an approach that operates at a higher lever of abstraction than current metaheuristic approaches. The hyperheuristic manages the choice of which lowerlevel heuristic method should be applied at any given time, depending upon the characteristics of the region of the solution space currently under exploration. We analyse the behaviour of several different hyperheuristic approaches for a real-world personnel scheduling problem. Results obtained show the effectiveness of our approach for this problem and suggest wider applicability of hyperheuristic approaches to other problems of scheduling and combinatorial optimisation.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1007/3-540-44629-X_11 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

The URL for additional information is http://dx.doi.org/10.1007/3-540-44629-X

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{cks2001, author = {P. Cowling and G. Kendall and E. Soubeiga},
title = {A Hyperheuristic Approach to Scheduling a Sales Summit},
booktitle = {Selected papers from the 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT 2001)},
year = {2001},
editor = {E. Burke and W. Erben},
volume = {2079},
series = {Lecture Notes in Computer Science},
pages = {176--190},
publisher = {Springer},
abstract = {The concept of a hyperheuristic is introduced as an approach that operates at a higher lever of abstraction than current metaheuristic approaches. The hyperheuristic manages the choice of which lowerlevel heuristic method should be applied at any given time, depending upon the characteristics of the region of the solution space currently under exploration. We analyse the behaviour of several different hyperheuristic approaches for a real-world personnel scheduling problem. Results obtained show the effectiveness of our approach for this problem and suggest wider applicability of hyperheuristic approaches to other problems of scheduling and combinatorial optimisation.},
doi = {10.1007/3-540-44629-X_11},
keywords = {hyper-heuristic, hyperheuristic, schedules, sales summit, choice function},
timestamp = {2007.03.29},
url = {http://dx.doi.org/10.1007/3-540-44629-X},
webpdf = {http://www.graham-kendall.com/papers/cks2001.pdf} }