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

If you are interested in hyper-heuristics, take a look at my publications in this area
http://bit.ly/efxLGg
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

What is Operations Research?

Publication(s)

Choice Function based Hyper-heuristics for Multi-objective Optimization
http://bit.ly/1rquSdW
An Iterated Local Search with Multiple Perturbation Operators and Time Varying Perturbation Steength for the Aircraft Landing Problem
http://bit.ly/1KJ1818
A Hybrid Differential Evolution Algorithm - Game Theory for the Berth Allocation Problem
http://bit.ly/1OjS0k9
An experimental study of hyper-heuristic selection and acceptance mechanism for combinatorial t -way test suite generation
http://bit.ly/2qeXUC5

Graham Kendall: Details of Requested Publication


Citation

Burke, E.K and Kendall, G Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. In Proceedings of the World Manufacturing Congress (WMC '99), pages 70-76, ICSC Academic Press, 27-30 September 1999, Durham, UK, 1999.


Abstract

This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a meta-heuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in order to improve the efficiency of the algorithm whilst maintaining solution quality. Computational results are given


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{bk1999c, author = {E.K. Burke and G. Kendall},
title = {Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem},
booktitle = {Proceedings of the World Manufacturing Congress (WMC '99)},
year = {1999},
pages = {70--76},
address = {27-30 September 1999, Durham, UK},
publisher = {ICSC Academic Press},
abstract = {This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a meta-heuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in order to improve the efficiency of the algorithm whilst maintaining solution quality. Computational results are given},
comment = {ISBN 3-906454-19-3},
keywords = {packing, nesting, no fit polygon, NFP, simulated annealing},
timestamp = {2007.03.29},
webpdf = {http://www.graham-kendall.com/papers/bk1999c.pdf} }