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

Can ants play chess? Yes they can!
http://bit.ly/1yW3UhX
I am involved with a spin out company that specialises in Strategic Resource Planning
http://bit.ly/eTPZO2

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Ranking’s research impact indicator is skewed

Publication(s)

Engineering Design of Strategies for Winning Iterated Prisoner’s Dilemma Competitions
http://bit.ly/1goRemG
The effect of memory size on the evolutionary stability of strategies in iterated prisoner's dilemma
http://bit.ly/1HXMzXa
A Heuristic Approach for the Travelling Tournament Problem using Optimal Travelling Salesman Tours
http://bit.ly/fmZWW1
A decision support approach for group decision making under risk and uncertainty
http://bit.ly/i4aRjQ

Graham Kendall: Details of Requested Publication


Citation

Burke, E.K; Hellier, R; Kendall, G and Whitwell, G Complete and robust no-fit polygon generation for the irregular stock cutting problem. European Journal of Operational Research, 179 (1): 27-49, 2007.


Abstract

The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Previously, the no-fit polygon (NFP) has not been widely applied because of the perception that it is difficult to implement and because of the lack of generic approaches that can cope with all problem cases without specific case-by-case handling. This paper introduces a robust orbital method for the creation of no-fit polygons which does not suffer from the typical problem cases found in the other approaches from the literature. Furthermore, the algorithm only involves two simple geometric stages so it is easily understood and implemented. We demonstrate how the approach handles known degenerate cases such as holes, interlocking concavities and jigsaw type pieces and we give generation times for 32 irregular packing benchmark problems from the literature, including real world datasets, to allow further comparison with existing and future approaches.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is doi:10.1016/j.ejor.2006.03.011 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 (2.358), 2013 (1.843), 2012 (2.038), 2011 (1.815), 2010 (2.158), 2009 (2.093), 2008 (1.627), 2007 (1.096), 2006 (0.918), 2005 (0.824), 2004 (0.828), 2003 (0.605), 2002 (0.553), 2001 (0.494), 2000 (0.490)

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{bhkw2007, author = {E.K. Burke and R. Hellier and G. Kendall and G. Whitwell},
title = {Complete and robust no-fit polygon generation for the irregular stock cutting problem},
journal = {European Journal of Operational Research},
year = {2007},
volume = {179},
pages = {27--49},
number = {1},
month = {May 2007},
abstract = {The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Previously, the no-fit polygon (NFP) has not been widely applied because of the perception that it is difficult to implement and because of the lack of generic approaches that can cope with all problem cases without specific case-by-case handling. This paper introduces a robust orbital method for the creation of no-fit polygons which does not suffer from the typical problem cases found in the other approaches from the literature. Furthermore, the algorithm only involves two simple geometric stages so it is easily understood and implemented. We demonstrate how the approach handles known degenerate cases such as holes, interlocking concavities and jigsaw type pieces and we give generation times for 32 irregular packing benchmark problems from the literature, including real world datasets, to allow further comparison with existing and future approaches.},
date-modified = {2007-01-16 16:10:05 +0000},
doi = {doi:10.1016/j.ejor.2006.03.011},
issn = {0377-2217},
keywords = {Cutting, Packing, No-fit polygon, Orbital approach},
webpdf = {http://www.graham-kendall.com/papers/bhkw2007.pdf} }