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

Help solve Santa's logistics problems
http://bit.ly/1DXreuW
I have published a number of papers on Cutting and Packing
http://bit.ly/dQPw7T

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Football Scheduling: News Story

Publication(s)

A hyper-heuristic methodology to generate adaptive strategies for games
http://bit.ly/1ipWJDQ
Chapter 1: The Iterated Prisoners' Dilemma: 20 Years On
http://bit.ly/1hBtwEs
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
http://bit.ly/gkQlW3
An Investigation, using Co-Evolution, to Evolve an Awari Player
http://bit.ly/dVtkw8

Graham Kendall: Details of Requested Publication


Citation

Chen, J; Bai, R; Qu, R and Kendall, G A task based approach for a real-world commodity routing problem. In Proceedings of the 2013 IEEE Workshop on Computational Intelligence In Production And Logistics Systems (CIPLS), pages 1-8, 2013.


Abstract

In this paper, a real world short-haul commodity routing problem is presented. This problem shares several similarities with vehicle routing problem with time windows (VRPTW) and the service network design problem (SNDP), but also has its own specific structures that do not exist in VRPTW or SNDP. A task based formulation is developed for this problem and a variable neighbourhood search metaheuristic approach is proposed, resulting in a visible improvement over the original routing plans according to experimental tests over three real-life instances. Apart from introducing a new real-world commodity routing problem, another main contribution of this paper is a task based formulation that allows commodity flows being considered as nodes in a routing network. Thus algorithms that were designed for VRPTW or SDVRP can also possibly be adapted to solve this commodity flow problem.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1109/CIPLS.2013.6595193 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



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

@INPROCEEDINGS{cbqk2013, author = {J. Chen and R. Bai and R. Qu and G. Kendall},
title = {A task based approach for a real-world commodity routing problem},
booktitle = {Proceedings of the 2013 IEEE Workshop on Computational Intelligence In Production And Logistics Systems (CIPLS)},
year = {2013},
pages = {1--8},
abstract = {In this paper, a real world short-haul commodity routing problem is presented. This problem shares several similarities with vehicle routing problem with time windows (VRPTW) and the service network design problem (SNDP), but also has its own specific structures that do not exist in VRPTW or SNDP. A task based formulation is developed for this problem and a variable neighbourhood search metaheuristic approach is proposed, resulting in a visible improvement over the original routing plans according to experimental tests over three real-life instances. Apart from introducing a new real-world commodity routing problem, another main contribution of this paper is a task based formulation that allows commodity flows being considered as nodes in a routing network. Thus algorithms that were designed for VRPTW or SDVRP can also possibly be adapted to solve this commodity flow problem.},
doi = {10.1109/CIPLS.2013.6595193},
owner = {Graham},
timestamp = {2016.02.07},
webpdf = {http://www.graham-kendall.com/papers/cbqk2013.pdf} }