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

Does AI have a place in the board room?
http://bit.ly/1DXreuW
I blog occasionally, feel free to take a look.
http://bit.ly/hq6rMK

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

What is Operations Research?

Publication(s)

Hybridising heuristics within an estimation distribution algorithm for examination timetabling
http://bit.ly/1Plbd56
Evidence and belief in regulatory decisions Incorporating expected utility into decision modelling
http://bit.ly/1iaJTKT
Solving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm
http://bit.ly/fCOMDK
Constructing Initial Neighbourhoods to Identify Critical Constraints
http://bit.ly/h3xfnd

Graham Kendall: Details of Requested Publication


Citation

Dowsland, K.A; Gilbert, M and Kendall, G A local search approach to a circle cutting problem arising in the motor cycle industry. Journal of the Operational Research Society, 58 (4): 429-438, 2007.


Abstract

This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 2030 s per order as compared to several hours for an equivalent manual solution.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1057/palgrave.jors.2602170 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 (0.953), 2013 (0.911), 2012 (0.989), 2011 (0.971), 2010 (1.102), 2009 (1.009), 2008 (0.839), 2007 (0.784), 2006 (0.597), 2005 (0.603), 2004 (0.515), 2003 (0.416), 2002 (0.493), 2001 (0.438), 2000 (0.648)

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{dgk2007, author = {K.A. Dowsland and M. Gilbert and G. Kendall},
title = {A local search approach to a circle cutting problem arising in the motor cycle industry},
journal = {Journal of the Operational Research Society},
year = {2007},
volume = {58},
pages = {429--438},
number = {4},
abstract = {This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 2030 s per order as compared to several hours for an equivalent manual solution.},
doi = {10.1057/palgrave.jors.2602170},
issn = {0160-5682},
keywords = {heuristics, local search, cutting stock problem, production, cutting, packing},
owner = {est},
timestamp = {2010.02.22},
webpdf = {http://www.graham-kendall.com/papers/dgk2007.pdf} }