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
How are university examinations scheduled?
http://bit.ly/1z0pG4s

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Geocoding: Trials and Tribulations

Publication(s)

A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
http://bit.ly/h1puUB
An Investigation of a Tabu Search Based Hyper-Heuristic for Examination Timetabling
http://bit.ly/1mlqRSh
Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation
http://bit.ly/dVxwCs
Measuring the Robustness of Airline Fleet Schedules
http://bit.ly/1mlqXcv

Graham Kendall: Details of Requested Publication


Citation

Hyde, M; Burke, E. K and Kendall, G Evolving human-competitive reusable 2D strip packing heuristics. In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009): Late Breaking Papers, pages 2189-2191, Montreal, Canada. 8-12 July, 2009.

Please note that this paper appeared in the Late Breaking Papers proceedings

A follow up journal paper (Burke, E. K; Hyde, M; Kendall, G and Woodward, J A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14 (6): 942-958, 2010) can be seen here


Abstract

This extended abstract presents preliminary work on reusable automatically generated heuristics for the 2D strip packing problem. It builds on our previous work, where the heuristics were not shown to be reusable. The best constructive heuristic for this problem in the literature is 'best-fit', and the motivation of this work is to obtain heuristics which are comparable to the performance of this heuristic.


pdf

There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)


doi

The doi for this publication is 10.1145/1570256.1570299 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{hbk2009, author = {M. Hyde and E. K. Burke and G. Kendall},
title = {Evolving human-competitive reusable 2D strip packing heuristics},
booktitle = {Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009): Late Breaking Papers},
year = {2009},
pages = {2189--2191},
address = {Montreal, Canada. 8-12 July},
note = {Please note that this paper appeared in the Late Breaking Papers proceedings

A follow up journal paper (Burke, E. K; Hyde, M; Kendall, G and Woodward, J A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14 (6): 942-958, 2010) can be seen here},
abstract = {This extended abstract presents preliminary work on reusable automatically generated heuristics for the 2D strip packing problem. It builds on our previous work, where the heuristics were not shown to be reusable. The best constructive heuristic for this problem in the literature is 'best-fit', and the motivation of this work is to obtain heuristics which are comparable to the performance of this heuristic.},
doi = {10.1145/1570256.1570299},
keywords = {Genetic Programming, Hyper-heuristics, Cutting, Packing, hyperheuristics},
owner = {gxk},
timestamp = {2011.01.16} }