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 few papers on Sports Scheduling.
http://bit.ly/gVaUqT
Can ants play chess? Yes they can!
http://bit.ly/1yW3UhX

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Update: Displaying bibtex on web site

Publication(s)

Irregular Packing using the Line and Arc No-Fit Polygon
http://bit.ly/hf6IdA
Evaluating decision-making units under uncertainty using fuzzy multi-objective nonlinear programming
http://bit.ly/2k79ATE
Monte Carlo hyper-heuristics for examination timetabling
http://bit.ly/1mlqSFO
An ant algorithm hyperheuristic for the project presentation scheduling problem
http://bit.ly/gbUor9

Graham Kendall: Details of Requested Publication


Citation

Qu, R; Xu, Y and Kendall, G A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing. In Proceedings of Learning and Intelligent Optimization: Designing, Implementing and Analyzing Effective Heuristics (LION 3), pages 15-29, Springer Berlin / Heidelberg, Lecture Notes in Computer Science 5851, 2009.


Abstract

The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained least-cost (DCLC) multicast routing problem. The neighborhood structures designed in the VND approaches are based on the idea of path replacement in trees. They are simple, yet effective operators, enabling a flexible search over the solution space of this complex problem with multiple constraints. A large number of simulations demonstrate that our algorithm is highly efficient in solving the DCLC multicast routing problem in terms of the tree cost and execution time. To our knowledge, this is the first study of VND algorithm on the DCLC multicast routing problem. It outperforms other existing algorithms over a range of problem instances.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1007/978-3-642-11169-3_2 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{qxk2009, author = {R. Qu and Y. Xu and G. Kendall},
title = {A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing},
booktitle = {Proceedings of Learning and Intelligent Optimization: Designing, Implementing and Analyzing Effective Heuristics (LION 3)},
year = {2009},
editor = {T. St\"{u}tzle},
volume = {5851},
series = {Lecture Notes in Computer Science},
pages = {15--29},
month = {January},
organization = {Trento, Italy},
publisher = {Springer Berlin / Heidelberg},
abstract = {The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained least-cost (DCLC) multicast routing problem. The neighborhood structures designed in the VND approaches are based on the idea of path replacement in trees. They are simple, yet effective operators, enabling a flexible search over the solution space of this complex problem with multiple constraints. A large number of simulations demonstrate that our algorithm is highly efficient in solving the DCLC multicast routing problem in terms of the tree cost and execution time. To our knowledge, this is the first study of VND algorithm on the DCLC multicast routing problem. It outperforms other existing algorithms over a range of problem instances.},
doi = {10.1007/978-3-642-11169-3_2},
keywords = {multimedia, quality of service, variable neighborhood descent, heuristics, meta-heuristics},
owner = {est},
timestamp = {2010.03.18},
webpdf = {http://www.graham-kendall.com/papers/qxk2009.pdf} }