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

The hunt for MH370
http://bit.ly/1DXRLbu
How are university examinations scheduled?
http://bit.ly/1z0pG4s

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

How can academics use Twitter effectively?

Publication(s)

Combining Examinations to Accelerate Timetable Construction
http://bit.ly/e5KkBg
Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
http://bit.ly/gIBeuh
Problem Difficulty and Code Growth in Genetic Programming
http://bit.ly/eTibpi
A local search approach to a circle cutting problem arising in the motor cycle industry
http://bit.ly/dJxzGW

Packing Papers

The publications below were retuned by searching for packing in the title, abstract and keywords of my publications.

Journal Articles

2015

  1. Sabar, N. R; Ayob, M; Kendall, G and Qu, R Automatic Design of Hyper-heuristic Framework with Gene Expression Programming for Combinatorial Optimization problems. IEEE Transactions on Evolutionary Computation, 19 (3): 309-325, 2015.

    ISSN: 1089-778X

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Sabar, N. R and Kendall, G Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems. Information Sciences, 314: 225-239, 2015.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2012

  1. Bai, R; Blazewicz, J; Burke, E. K; Kendall, G and McCollum, B A Simulated Annealing Hyper-heuristic Methodology for Flexible Decision Support. 4OR - A Quarterly Journal of Operations Research, 10 (1): 43-66, 2012.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E.K; Hyde, M; Kendall, G and Woodward, J Automating the Packing Heuristic Design Process with Genetic Programming. Evolutionary Computation, 20 (1): 63-89, 2012.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  3. Burke, E. K; Hyde, M. R and Kendall, G Grammatical Evolution of Local Search Heuristics. IEEE Transactions on Evolutionary Computation, 16 (3): 406-417, 2012.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2011

  1. 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.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Bak, S; Blazewicz, J; Pawlak, G; Plaza, M; Burke, E.K and Kendall, G A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem. INFORMS Journal on Computing, 23 (1): 15-25, 2011.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  3. Burke, E.K; Hyde, M.R and Kendall, G A Squeaky Wheel Optimisation Methodology for Two Dimensional Strip Packing. Computers & Operations Research, 38 (7): 1035-1044, 2011.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2010

  1. Burke, E.K; Hellier, R; Kendall, G and Whitwell, a. G Irregular Packing using the Line and Arc No-Fit Polygon. Operations Research, 58 (4): 948-970, 2010.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E. K; Hyde, M; Kendall, G and Woodward, J A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14 (6): 942-958, 2010.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2008

  1. Bai, R and Kendall, G A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand. INFORMS Journal on Computing, 20 (1): 78-85, 2008.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2007

  1. 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.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. 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.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2006

  1. 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.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Dowsland, K. A; Herbert, E.A; G. Kendall, G. and Burke, E Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems. European Journal of Operational Research, 168 (2): 390-402, 2006.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2004

  1. Burke, E.K; Kendall, G and Whitwell, G A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research, 52 (4): 655-671, 2004.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

1999

  1. Burke, E and Kendall, G Comparison of meta-heuristic algorithms for clustering rectangles. Computers and Industrial Engineering, 37 (1-2): 383-386, 1999.

    Proceedings of the 24th international conference on computers and industrial engineering

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

Book chapters

2014

  1. Burke, E.K and Kendall, G Chapter 1: Introduction. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, 2nd ed., pages 1-17, Springer, 2014.

    This is the introductory chapter that we wrote for this book

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Kendall, G Evolutionary Computation in the Real World: Successes and Challenges. In Knowledge and Systems Engineering: Advances in Intelligent Systems and Computing, Volume 245, pages 5-5, Springer, 2014.

    This paper is an abstract of an invited talk I gave at the Fifth International Conference KSE (Knowledge and Systems Engineering) 2013. It forms a one page chapter in Knowledge and Systems Engineering: Advances in Intelligent Systems and Computing, Volume 245 (see here)

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2005

  1. Bai, R and Kendall, G Chapter 4: An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic. In Metaheuristics: Progress as Real Problem Solvers (Operations Research/Computer Science Interfaces Series, Volume 32, Part III), pages 87-108, Springer, 2005.

    A previous version of this paper was published in the 2003 Metaheuristics International Conference (MIC) proceedings

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E.K and Kendall, G Chapter 1: Introduction. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pages 5-18, Springer, 2005.

    This is the introductory chapter that we wrote for this book

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

In Proceedings

2013

  1. Grobler, J; Engelbrecht, A.P; Kendall, G and Yadavalli, V.S.S Multi-method algorithms: Investigating the entity-to-algorithm allocation problem. In Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), pages 570-577, 2013.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Kirke, T; While, L and Kendall, G Multi-drop container loading using a multi-objective evolutionary algorithm. In Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), pages 165-172, 2013.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2011

  1. Burke, E.K; Q., Gu and Kendall, G A Hyper-Heuristic Approach to Strip Packing Problems. In Proceedings of Problem Parallel Solving from Nature (PPSN XI), Sep 2010, pages 465-474, Springer Berlin / Heidelberg, Lecture Notes in Computer Science 6238, 2011.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2010

  1. Burke, E.K; Curtois, T; Hyde, M; Kendall, G; Ochoa, G; Petrovic, S; Vázquez-Rodríguez, J.A and Gendreau, M Iterated Local Search vs. Hyper-heuristics: Towards General-Purpose Search Algorithms. In Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), pages 3073-3080, 2010.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E.K; Hyde, M.R and Kendall, G Providing a memory mechanism to enhance the evolutionary design of heuristics. In Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), pages 3883-3890, 2010.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2009

  1. Allen, S; Burke, E.K; Hyde, M and Kendall, G Evolving Reusable 3D Packing Heuristics with Genetic Programming. In Proceedings of the 11th Annual conference on Genetic and evolutionary computation (GECCO 2009), pages 931-938, 2009.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E. K; Curtois, T; Kendall, G; Hyde, M; Ochoa, G; Vazquez-Rodriguez, J.A and Petrovic, S Towards the 'Decathlon 'Challenge' of search heuristics. In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009): Late Breaking Papers, pages 2205-2208, Montreal, Canada. 8-12 July, 2009.

    Please note that this paper appeared in the Late Breaking Papers proceedings

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  3. Hyde, M; Burke, E. K and Kendall, G Evolving human-competitive reusable 2D strip packing heuristics. In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009): Late Breaking Papers, pages 2189-2191, Montreal, Canada. 8-12 July, 2009.

    Please note that this paper appeared in the Late Breaking Papers proceedings

    A follow up journal paper (Burke, E. K; Hyde, M; Kendall, G and Woodward, J A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics. IEEE Transactions on Evolutionary Computation, 14 (6): 942-958, 2010) can be seen here

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2007

  1. Burke, E.K; Hyde, M.R; Kendall, G and Woodward, J Automatic Heuristic Generation with Genetic Programming: Evolving a Jack-of-all-Trades or a Master of One. In Proceedings of the 9th annual conference on Genetic and evolutionary computation (GECCO 20077, pages 1559-1565, London, UK, 2007.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E. K; Hyde, M; Kendall, G and Woodward, J The Scalability of Evolved On Line Bin Packing Heuristics. In Proceedings of Congress on Evolutionary Computation (CEC 2007), pages 2530-2537, 2007.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2006

  1. Burke, E.K; Hyde, M.R and Kendall, G Evolving Bin Packing Heuristics with Genetic Programming. In Proceedings of the 9th International Conference on Parallel Problem Solving from Nature (PPSN 2006), pages 860-869, Lecture Notes in Computer Science 4193, 2006.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2003

  1. Bai, R and Kendall, G An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-heuristics. In Proceedings of The Fifth Metaheuristics International Conference (MIC 2003), pages 03-1-03-7, Kyoto International Conference Hall, Kyoto, Japan, 2003.

    An extended version of this paper was published in post-conference, selected papers book.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

2002

  1. Burke, E.K and Kendall, G A New Approach to Packing Non-Convex Polygons Using the No Fit Polygon and Meta-Heuristic and Evolutionary Algorithms. In Proceedings of the 5th International Conference on Adapative Computing in Design and Manufacture (ACDM 2002), pages 193-204, Springer-Verlag, University of Exeter, UK, 16-18 April, 2002.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

1999

  1. Burke, E.K and Kendall, G Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem. In Proceedings of the 12th Australian Joint Conference on Artificial Intelligence (AIí99), pages 453-464, Sydney, Australia, 6-10 December, Lecture Notes in Artifcial Intelligence 1747, 1999.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  2. Burke, E.K and Kendall, G Evaluation of Two Dimensional Bin Packing Problem using the No Fit Polygon. In Proceedings of the 26th International Conference on Computers and Industrial Engineering, pages 286-291, 15-17 December 1999, Melbourne, Australia, 1999.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  3. Burke, E.K and Kendall, G Applying Simulated Annealing and the No Fit Polygon to the Nesting Problem. In Proceedings of the World Manufacturing Congress (WMC '99), pages 70-76, ICSC Academic Press, 27-30 September 1999, Durham, UK, 1999.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

  4. Burke, E.K and Kendall, G Applying Evolutionary Algorithms and the No Fit Polygon to the Nesting Problem. In Proceedings of the 1999 International Conference on Artificial Intelligence (IC-AI'99), pages 51-57, 28 June - 1 July, 1999, Monte Carlo Resort, Las Vegas, Nevada, USA, 1999.

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here

PhD Theses

2001

  1. 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

    More details for this paper (incl. download information, abstract, bibtex, journal ranking (if applicable) etc.) is available here