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

What do we spend so much in supermarkets?
http://bit.ly/1yW6If7
How are football fixtures worked out?
http://bit.ly/1z0oTAH

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

3D Bin Packing, help Santa and share $10,000

Publication(s)

Evolutionary Computation and Games (Invited Review)
RATE_LIMIT_EXCEEDED
Evolutionary Strategies vs. Neural Networks; New Evidence from Taiwan on the Divisia Index Debate
RATE_LIMIT_EXCEEDED
The Scalability of Evolved On Line Bin Packing Heuristics
RATE_LIMIT_EXCEEDED
Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling
RATE_LIMIT_EXCEEDED

Graham Kendall: Details of Requested Publication


Citation

Kendall, G Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising The No Fit Polygon. Ph.D. Thesis, School of Computer Science, University of Nottingham, UK, 2001.

I started my PhD in September 1997 and graduated in July 2001. My viva took place on 1st December 2000


Abstract

This thesis develops and investigates meta-heuristic and evolutionary approaches to the stock cutting problem. In particular, we concentrate on hill climbing, tabu search, simulated annealing, genetic algorithms, ant algorithms and two types of memetic algorithm. In carrying out this work, a number of diverse issues have had to be explored. It is often the case that the evaluation function is a bottleneck within a search algorithm. This thesis shows that by using a cache to store previously evaluated solutions, the evaluation function does not have to be called when the solution is already in the cache. This significantly improves the speed of the algorithm. However, under certain circumstances, it is beneficial to re-evaluate a solution even though it is stored in the cache. This thesis shows under which conditions this applies and shows that the re-evaluation only has to be done with low probability without affecting solution quality. Ant algorithms are investigated for the first time with regard to stock cutting. This algorithm is relatively new but has been applied successfully to difficult search problems including the travelling salesman problem, vehicle routing and the quadratic assignment problem. In addition, we have implemented and evaluated hybrid ant algorithms with a local search operator. This thesis also develops a no fit polygon algorithm, which is used to pack non-convex shapes. Throughout this thesis both tabu search and a genetic based memetic algorithm consistently produce the best quality results. This is despite trying to find suitable parameters for the other search algorithms so that they carry out more effective searches. The conclusion is that, although tabu search and a genetic based memetic algorithm produce the best quality results, it does not follow that they are the best search strategies for all problems. If there was one area of research that arose from this work it is a need for investigating methods of applying the correct search strategy to any given problem instance.


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

@PHDTHESIS{k2001, author = {G. Kendall},
title = {Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising The No Fit Polygon},
school = {School of Computer Science, University of Nottingham, UK},
year = {2001},
type = {PhD},
note = {I started my PhD in September 1997 and graduated in July 2001. My viva took place on 1st December 2000},
abstract = {This thesis develops and investigates meta-heuristic and evolutionary approaches to the stock cutting problem. In particular, we concentrate on hill climbing, tabu search, simulated annealing, genetic algorithms, ant algorithms and two types of memetic algorithm. In carrying out this work, a number of diverse issues have had to be explored. It is often the case that the evaluation function is a bottleneck within a search algorithm. This thesis shows that by using a cache to store previously evaluated solutions, the evaluation function does not have to be called when the solution is already in the cache. This significantly improves the speed of the algorithm. However, under certain circumstances, it is beneficial to re-evaluate a solution even though it is stored in the cache. This thesis shows under which conditions this applies and shows that the re-evaluation only has to be done with low probability without affecting solution quality. Ant algorithms are investigated for the first time with regard to stock cutting. This algorithm is relatively new but has been applied successfully to difficult search problems including the travelling salesman problem, vehicle routing and the quadratic assignment problem. In addition, we have implemented and evaluated hybrid ant algorithms with a local search operator. This thesis also develops a no fit polygon algorithm, which is used to pack non-convex shapes. Throughout this thesis both tabu search and a genetic based memetic algorithm consistently produce the best quality results. This is despite trying to find suitable parameters for the other search algorithms so that they carry out more effective searches. The conclusion is that, although tabu search and a genetic based memetic algorithm produce the best quality results, it does not follow that they are the best search strategies for all problems. If there was one area of research that arose from this work it is a need for investigating methods of applying the correct search strategy to any given problem instance.},
keywords = {Cutting, Packing, Meta-heuristics, No Fit Polygon},
webpdf = {http://www.graham-kendall.com/papers/k2001.pdf} }