

I am a Professor of Computer Science at the University of Nottingham (UK). I am currently the Vice-Provost (Research and Knowledge Transfer) at our campus in Malaysia. I am a member of the Automated Scheduling, Optimisation and Planning (ASAP) Research Group. My interests include Operational Research, Evolutionary Computing, Scheduling (particularly sports scheduling), Cutting and Packing, Timetabling and Games (both games in the usual sense of the word as well as mathematical games such as the Iterated Prisoners Dilemma).
An efficient guided local search approach for service network design problem with asset balancing. In In proceedings of the 2010 International Conference on Logistics Systems and Intelligent Management, pages 110-115, 2010.
Service network design is a core problem for logistic transportation planning. It involves determination of the most cost-effective transportation network, package flow distribution as well as balanced vehicle schedules. In this paper, we propose an efficient guided local search approach metaheuristic for this problem, which is able to produce competitive results with much less computational time than those proposed in the literature.
You can download the pdf of this publication from here
The doi for this publication is 10.1109/ICLSIM.2010.5461456 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
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.
@INPROCEEDINGS{bkl2010, author = {R. Bai and G. Kendall and J. Li},
title = {An efficient guided local search approach for service network design problem with asset balancing},
booktitle = {In proceedings of the 2010 International Conference on Logistics Systems and Intelligent Management},
year = {2010},
pages = {110--115},
month = {9-10 Jan. 2010},
organization = {Harbin, China},
abstract = {Service network design is a core problem for logistic transportation planning. It involves determination of the most cost-effective transportation network, package flow distribution as well as balanced vehicle schedules. In this paper, we propose an efficient guided local search approach metaheuristic for this problem, which is able to produce competitive results with much less computational time than those proposed in the literature.},
doi = {10.1109/ICLSIM.2010.5461456},
keywords = {Logistics, Freight Transportation, Guided Local Search, Linear Programming},
owner = {gxk},
timestamp = {2010.12.11},
webpdf = {http://www.graham-kendall.com/papers/bkl2010.pdf} }