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

A Conversation article celebrating Pi
http://bit.ly/1DXuXbV
What do we spend so much in supermarkets?
http://bit.ly/1yW6If7

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Using ELO ratings for match result prediction in association football

Publication(s)

A hyper-heuristic approach to sequencing by hybridization of DNA sequences
http://bit.ly/1mlNjL6
A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine
http://bit.ly/dJZXFI
A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine
http://bit.ly/dJZXFI
Scheduling TV Commercials: Models and Solution Methodologies
http://bit.ly/idSBCA

Graham Kendall: Details of Requested Publication


Citation

Burke, E. K; Hellier, R; Kendall, G and Whitwell, G A New Bottom-left-Fill Heuristic Algorithm for the 2D Irregular Packing Problem. Operations Research, 54 (3): 587-601, 2006.


Abstract

This paper presents a new heuristic algorithm for the two-dimensional irregular stock-cutting problem, which generates significantly better results than the previous state of the art on a wide range of established benchmark problems. The developed algorithm is able to pack shapes with a traditional line representation, and it can also pack shapes that incorporate circular arcs and holes. This in itself represents a significant improvement upon the state of the art. By utilising hill climbing and tabu local search methods, the proposed technique produces 25 new best solutions for 26 previously reported benchmark problems drawn from over 20 years of cutting and packing research. These solutions are obtained using reasonable time frames, the majority of problems being solved within five minutes. In addition to this, we also present 10 new benchmark problems, which involve both circular arcs and holes. These are provided because of a shortage of realistic industrial style benchmark problems within the literature and to encourage further research and greater comparison between this and future methods.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1287/opre.1060.0293 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


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2014 (1.743), 2013 (1.500), 2012 (1.786), 2011 (1.665), 2010 (1.995), 2009 (1.576), 2008 (1.463), 2007 (1.467), 2006 (1.234), 2005 (1.219), 2004 (0.803), 2003 (0.672), 2002 (0.892), 2001 (0.813), 2000 (1.006)

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

@ARTICLE{bhkw2006, author = {E. K. Burke and R. Hellier and G. Kendall and G. Whitwell},
title = {A New Bottom-left-Fill Heuristic Algorithm for the 2D Irregular Packing Problem},
journal = {Operations Research},
year = {2006},
volume = {54},
pages = {587--601},
number = {3},
month = {May-June 2006},
abstract = {This paper presents a new heuristic algorithm for the two-dimensional irregular stock-cutting problem, which generates significantly better results than the previous state of the art on a wide range of established benchmark problems. The developed algorithm is able to pack shapes with a traditional line representation, and it can also pack shapes that incorporate circular arcs and holes. This in itself represents a significant improvement upon the state of the art. By utilising hill climbing and tabu local search methods, the proposed technique produces 25 new best solutions for 26 previously reported benchmark problems drawn from over 20 years of cutting and packing research. These solutions are obtained using reasonable time frames, the majority of problems being solved within five minutes. In addition to this, we also present 10 new benchmark problems, which involve both circular arcs and holes. These are provided because of a shortage of realistic industrial style benchmark problems within the literature and to encourage further research and greater comparison between this and future methods.},
doi = {10.1287/opre.1060.0293},
issn = {0030-364X},
keywords = {Cutting, Packing, Irregular, Polygon, Hill Climbing, Tabu Search, Local Search},
timestamp = {2008.02.28},
webpdf = {http://www.graham-kendall.com/papers/bhkw2006.pdf} }