

I am a Professor of Computer Science at the University of Nottingham (UK). I am currently the Vice-Provost (Research and Knowledge Transfer) at our campus in Malaysia. I am a member of the Automated Scheduling, Optimisation and Planning (ASAP) Research Group. My interests include Operational Research, Evolutionary Computing, Scheduling (particularly sports scheduling), Cutting and Packing, Timetabling and Games (both games in the usual sense of the word as well as mathematical games such as the Iterated Prisoners Dilemma).
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.
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.
You can download the pdf of this publication from here
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
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.
@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} }