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 have published a number of papers on Cutting and Packing
http://bit.ly/dQPw7T
I have wriiten a number of articles for TheConversation
http://bit.ly/1yWlOkE

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Snooker: Celebrating 40 years at the Crucible

Publication(s)

Barriers to implementation of IT in educational institutions
RATE_LIMIT_EXCEEDED
Backward Induction and Repeated Games With Strategy Constraints: An Inspiration From the Surprise Exam Paradox
RATE_LIMIT_EXCEEDED
Searching the Hyper-heuristic Design Space
RATE_LIMIT_EXCEEDED
A New Approach to Packing Non-Convex Polygons Using the No Fit Polygon and Meta-Heuristic and Evolutionary Algorithms
RATE_LIMIT_EXCEEDED

Graham Kendall: Details of Requested Publication


Citation

Moody, D; Kendall, G and Bar-Noy, A An efficient and robust approach to generate high quality solutions for the Traveling Tournament Problem. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), pages 273-282, 2010.


Abstract

The Traveling Tournament Problem (TTP) describes a typical sports scheduling challenge. The TTP, which is based on the U.S. Major League Baseball (MLB), has specific instances with results available on the web. Several approaches have been proposed since the problem’s creation. The “best” of these solutions use extensive resources in local search activities to find high quality solutions. We propose a tiling method that can produce a good quality solution, using a fraction of the resources documented in other approaches. Our solution can also be expanded to handle the additional real-world scheduling requirements, including unbalanced schedules within the MLB.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

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{mkb2010a, author = {D. Moody and G. Kendall and A. Bar-Noy},
title = {An efficient and robust approach to generate high quality solutions for the Traveling Tournament Problem.},
booktitle = {Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010)},
year = {2010},
editor = {B. McCollum and E.K. Burke},
pages = {273--282},
month = {11-13 August 2010},
organization = {Queen's University Belfast, UK},
abstract = {The Traveling Tournament Problem (TTP) describes a typical sports scheduling challenge. The TTP, which is based on the U.S. Major League Baseball (MLB), has specific instances with results available on the web. Several approaches have been proposed since the problem’s creation. The “best” of these solutions use extensive resources in local search activities to find high quality solutions. We propose a tiling method that can produce a good quality solution, using a fraction of the resources documented in other approaches. Our solution can also be expanded to handle the additional real-world scheduling requirements, including unbalanced schedules within the MLB.},
keywords = {Football, Soccer, Scheduling, Sports, TTP, Travelling Tournament Problem},
owner = {gxk},
timestamp = {2010.12.10},
webpdf = {http://www.graham-kendall.com/papers/mkb2010a.pdf} }