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
Does AI have a place in the board room?
http://bit.ly/1DXreuW

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Predicting the Results of Football Matches

Publication(s)

A Heuristic Approach for the Travelling Tournament Problem using Optimal Travelling Salesman Tours
http://bit.ly/fmZWW1
A Graph Coloring Constructive Hyper-Heuristic for Examination Timetabling Problems
http://bit.ly/1a3zv2M
A honey-bee mating optimization algorithm for educational timetabling problems
http://bit.ly/1dhSqnm
A Survey of NP-Complete Puzzles
http://bit.ly/hsErcv

Graham Kendall: Details of Requested Publication


Citation

Burke, E; Kendall, G; Silva, D. L.; O'Brien, R and Soubeiga, E. An ant algorithm hyperheuristic for the project presentation scheduling problem. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation, pages 2263-2270, 2005.


Abstract

Ant algorithms have generated significant research interest within the search/optimization community in recent years. Hyperheuristic research is concerned with the development of "heuristics to choose heuristics" in an attempt to raise the level of generality at which optimization systems can operate. In this paper the two are brought together. An investigation of the ant algorithm as a hyperheuristic is presented and discussed. The results are evaluated against other hyperheuristic methods, when applied to a real world scheduling problem.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1109/CEC.2005.1554976 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{bksos2005, author = {E. Burke and G. Kendall and D. Landa Silva and R. O'Brien and E. Soubeiga},
title = {An ant algorithm hyperheuristic for the project presentation scheduling problem},
booktitle = {Proceedings of the 2005 IEEE Congress on Evolutionary Computation},
year = {2005},
pages = {2263--2270},
abstract = {Ant algorithms have generated significant research interest within the search/optimization community in recent years. Hyperheuristic research is concerned with the development of "heuristics to choose heuristics" in an attempt to raise the level of generality at which optimization systems can operate. In this paper the two are brought together. An investigation of the ant algorithm as a hyperheuristic is presented and discussed. The results are evaluated against other hyperheuristic methods, when applied to a real world scheduling problem.},
doi = {10.1109/CEC.2005.1554976},
keywords = {ant algorithms, ACO, hyper-heuristic, hyperheuristic},
owner = {gxk},
timestamp = {2011.01.02},
webpdf = {http://www.graham-kendall.com/papers/bksos2005.pdf} }