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 involved with a spin out company that specialises in Strategic Resource Planning
http://bit.ly/eTPZO2
I have published a number of papers on Cutting and Packing
http://bit.ly/dQPw7T

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Vehicle Routing: Case Study at EURO

Publication(s)

An Integration of BP-Pool and Social Learning in the Opening of Go
http://bit.ly/1PtX9qq
Measuring the Robustness of Airline Fleet Schedules
http://bit.ly/1mlqXcv
A honey-bee mating optimization algorithm for educational timetabling problems
http://bit.ly/1dhSqnm
Backward Induction and Repeated Games With Strategy Constraints: An Inspiration From the Surprise Exam Paradox
http://bit.ly/1ib50Nd

Graham Kendall: Details of Requested Publication


Citation

Moody, D; Kendall, G and Bar-Noy, A Constructing Initial Neighbourhoods to Identify Critical Constraints. In Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008), 18-22 August 2008, Montreal, Canada, 2008.

This was published in the proceedings as an abstract (not a full paper)


Abstract

Recent course scheduling competitions have seen solution approaches which construct an initial solution quickly, and then employ a local search to improve the solution. With the use of different seeds, this process is repeated, searching for the best solution. Solutions with constraint violations provide little guidance on which constraints to relax in order to produce a better quality solution. Our approach seeks to construct several high quality initial solutions and analyze their characteristics which enables us to predict the relative success of the local search phase. With this capability, sets of initial solutions can be generated with selected constraint relaxations, leading to a prediction of which constraint relaxation can most improve the final solution, leading to a good quality solution.


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{mkb2008, author = {D. Moody and G. Kendall and A. Bar-Noy},
title = {Constructing Initial Neighbourhoods to Identify Critical Constraints},
booktitle = {Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2008)},
year = {2008},
editor = {E.K. Burke and M. Gendreau},
address = {18-22 August 2008, Montreal, Canada},
note = {This was published in the proceedings as an abstract (not a full paper)},
abstract = {Recent course scheduling competitions have seen solution approaches which construct an initial solution quickly, and then employ a local search to improve the solution. With the use of different seeds, this process is repeated, searching for the best solution. Solutions with constraint violations provide little guidance on which constraints to relax in order to produce a better quality solution. Our approach seeks to construct several high quality initial solutions and analyze their characteristics which enables us to predict the relative success of the local search phase. With this capability, sets of initial solutions can be generated with selected constraint relaxations, leading to a prediction of which constraint relaxation can most improve the final solution, leading to a good quality solution.},
keywords = {neighborhoods, constructive, course timetabling, heuristic},
owner = {rxj},
timestamp = {2008.09.12},
webpdf = {http://www.graham-kendall.com/papers/mkb2008.pdf} }