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

I am a member of the Automated Scheduling, Optimisation and Planning Research Group
http://bit.ly/eIQ5XC
How to teach Deep Blue to play poker and deliver groceries
http://bit.ly/1DXGeZD

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Horse Race Prediction with Neural Networks

Publication(s)

Monte Carlo hyper-heuristics for examination timetabling
http://bit.ly/1mlqSFO
An Integration of BP-Pool and Social Learning in the Opening of Go
http://bit.ly/1PtX9qq
The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey
http://bit.ly/fRZIdH
A Game Theoretic Approach for Taxi Scheduling Problem with Street Hailing
http://bit.ly/1hBsesZ

Graham Kendall: Details of Requested Publication


Citation

Chen, P-C.; Kendall, G and Berghe, G. V. An Ant Based Hyper-heuristic for the Travelling Tournament Problem. In Proceedings of 2007 IEEE Symposium of Computational Intelligence in Scheduling (CISched 2007), pages 19-26, 2007.


Abstract

The travelling tournament problem is a challenging sports timetabling problem which is widely believed to be NP-hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper-heuristic algorithm for this problem. Ant algorithms, a well known meta-heuristic, have been successfully applied to various problems. Whilst hyper-heuristics are an emerging technology, which operate at a higher level of abstraction than meta-heuristics. This paper presents a framework which employs ant algorithms as a hyper-heuristic. We show that this approach produces good quality solutions for the traveling tournament problem when compared with results from the literature


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1109/SCIS.2007.367665 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{ckv2007, author = {P-C. Chen and G. Kendall and G. Vanden Berghe},
title = {An Ant Based Hyper-heuristic for the Travelling Tournament Problem},
booktitle = {Proceedings of 2007 IEEE Symposium of Computational Intelligence in Scheduling (CISched 2007)},
year = {2007},
pages = {19--26},
organization = {Hawaii},
abstract = {The travelling tournament problem is a challenging sports timetabling problem which is widely believed to be NP-hard. The objective is to establish a feasible double round robin tournament schedule, with minimum travel distances. This paper investigates the application of an ant based hyper-heuristic algorithm for this problem. Ant algorithms, a well known meta-heuristic, have been successfully applied to various problems. Whilst hyper-heuristics are an emerging technology, which operate at a higher level of abstraction than meta-heuristics. This paper presents a framework which employs ant algorithms as a hyper-heuristic. We show that this approach produces good quality solutions for the traveling tournament problem when compared with results from the literature},
doi = {10.1109/SCIS.2007.367665},
keywords = {hyper-heuristics, hyperheuristic, TTP, Traveling Tournament Problem, ant, ACO, ant algorithm},
timestamp = {2007.07.28},
webpdf = {http://www.graham-kendall.com/papers/ckv2007.pdf} }