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
Help solve Santa's logistics problems
http://bit.ly/1DXreuW

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

New Blog Theme

Publication(s)

On Nie-Tan operator and type-reduction of interval type-2 fuzzy sets
http://bit.ly/2kqxtD3
A great deluge algorithm for a real-world examination timetabling problem
http://bit.ly/1xCdCSx
A Dynamic Multiarmed Bandit-Gene Expression Programming Hyper-Heuristic for Combinatorial Optimization Problems
http://bit.ly/1AfTYKx
A New Approach to Packing Non-Convex Polygons Using the No Fit Polygon and Meta-Heuristic and Evolutionary Algorithms
http://bit.ly/eMYCKs

Graham Kendall: Details of Requested Publication


Citation

Landa-Silva, D; Wang, Y; Donovan, P and Kendall, G Hybrid Heuristic for Multi-carrier Transportation Plans. In Proceedings of The Ninth Metaheuristics International Conference (MIC 2011), pages S1-231-S1-239, Udine, Italy, 2011.


Abstract

This paper describes a hybrid heuristic approach to construct transportation plans for a singlecustomer multi-carrier scenario that arises at 3T Logistics Ltd, a UK company that provides outsourced transportation planning and management services. The problem consists on planning the delivery, using a set of carrier companies, of a set of shipments from a warehouse to different consignees across the UK. The problem tackled resembles a vehicle routing problem with time windows but there are several differences in our scenario. The hybrid heuristic algorithm described here combines a clustering algorithm, constructive and local search heuristics, and exact assignment based on integer programming. This approach is being currently evaluated at the company and results so far indicate the suitability of the algorithm to produce practical transportation plans at reduced cost compared to current practice


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

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{lwdk2011, author = {D. Landa-Silva and Y. Wang and P. Donovan and G. Kendall},
title = {Hybrid Heuristic for Multi-carrier Transportation Plans},
booktitle = {Proceedings of The Ninth Metaheuristics International Conference (MIC 2011)},
year = {2011},
pages = {S1-231 -- S1-239},
address = {Udine, Italy},
month = {2528 July 2011},
abstract = {This paper describes a hybrid heuristic approach to construct transportation plans for a singlecustomer multi-carrier scenario that arises at 3T Logistics Ltd, a UK company that provides outsourced transportation planning and management services. The problem consists on planning the delivery, using a set of carrier companies, of a set of shipments from a warehouse to different consignees across the UK. The problem tackled resembles a vehicle routing problem with time windows but there are several differences in our scenario. The hybrid heuristic algorithm described here combines a clustering algorithm, constructive and local search heuristics, and exact assignment based on integer programming. This approach is being currently evaluated at the company and results so far indicate the suitability of the algorithm to produce practical transportation plans at reduced cost compared to current practice},
keywords = {hyper-heuristics, hyperheuristics, transport},
owner = {gxk},
timestamp = {2007.03.29},
webpdf = {http://www.graham-kendall.com/papers/lwdk2011.pdf} }