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

I have published a number of papers on Cutting and Packing
http://bit.ly/dQPw7T
Can ants play chess? Yes they can!
http://bit.ly/1yW3UhX

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Predicting the Results of Football Matches

Publication(s)

Regulators as agents: Modelling personality and power as evidence is brokered to support decisions on environmental risk
http://bit.ly/1bh6em7
An ant algorithm hyperheuristic for the project presentation scheduling problem
http://bit.ly/gbUor9
A Strategy with Novel Evolutionary Features for the Iterated Prisoner's Dilemma
http://bit.ly/eURggX
A New Dynamic Point Specification Approach to Optimise Surface Mount Placement Machine in Printed Circuit Board Assembly
http://bit.ly/hWCyZA

Graham Kendall: Details of Requested Publication


Citation

Allen, S. D; Burke, E.K and Kendall, G A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research, 209 (3): 219-227, 2011.


Abstract

This paper presents a hybrid placement strategy for the three-dimensional strip packing problem which involves packing a set of cuboids (‘boxes’) into a three-dimensional bin (parallelepiped) of fixed width and height but unconstrained length (the ‘container’). The goal is to pack all of the boxes into the container, minimising its resulting length. This problem has potential industry application in stock cutting (wood, polystyrene, etc. – minimising wastage) and also cargo loading, as well as other applications in areas such as multi-dimensional resource scheduling. In addition to the proposed strategy a number of test results on available literature benchmark problems are presented and analysed. The results of empirical testing of the algorithm show that it out-performs other methods from the literature, consistently in terms of speed and solution quality-producing 28 best known results from 35 test cases.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1016/j.ejor.2010.09.023 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{abk2011, author = {S. D. Allen and E.K. Burke and G. Kendall},
title = {A hybrid placement strategy for the three-dimensional strip packing problem},
journal = {European Journal of Operational Research},
year = {2011},
volume = {209},
pages = {219--227},
number = {3},
abstract = {This paper presents a hybrid placement strategy for the three-dimensional strip packing problem which involves packing a set of cuboids (‘boxes’) into a three-dimensional bin (parallelepiped) of fixed width and height but unconstrained length (the ‘container’). The goal is to pack all of the boxes into the container, minimising its resulting length. This problem has potential industry application in stock cutting (wood, polystyrene, etc. – minimising wastage) and also cargo loading, as well as other applications in areas such as multi-dimensional resource scheduling. In addition to the proposed strategy a number of test results on available literature benchmark problems are presented and analysed. The results of empirical testing of the algorithm show that it out-performs other methods from the literature, consistently in terms of speed and solution quality-producing 28 best known results from 35 test cases.},
doi = {10.1016/j.ejor.2010.09.023},
issn = {0377-2217},
keywords = {Cutting, Packing, Heuristics, Metaheuristics, meta-heuristics},
owner = {gxk},
timestamp = {2010.12.06},
webpdf = {http://www.graham-kendall.com/papers/abk2011.pdf} }