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

A Conversation article celebrating Pi
http://bit.ly/1DXuXbV
The hunt for MH370
http://bit.ly/1DXRLbu

Latest Blog Post

How Isaac Newton could help you beat the casino at roulette

Random Blog Post

Using ELO ratings for match result prediction in association football

Publication(s)

Multi-drop container loading using a multi-objective evolutionary algorithm
http://bit.ly/1mlJK7A
Diversity in Genetic Programming: An Analysis of Measures and Correlation with Fitness
http://bit.ly/gT5U5I
A task based approach for a real-world commodity routing problem
http://bit.ly/1mlrzCS
Chapter 1: Introduction
http://bit.ly/1tzAi1K

Graham Kendall: Details of Requested Publication


Citation

Bai, R; Li, J; Atkin, J.A.D and Kendall, G A novel approach to independent taxi scheduling problem based on stable matching. Journal of the Operational Research Society, 65 (10): 1501-1510, 2014.

Paper ISSN: 0160-5682 Electronic ISSN: 1476-9360


Abstract

This paper describes a taxi scheduling system, which aims to improve the overall efficiency of the system, both from the perspective of the drivers and the customers. This is of particular relevance to Chinese cities, where hailing a taxi on the street is by far the most common way in which taxis are requested, since the majority of taxi drivers operate independently, rather than working for a company. The mobile phone and Global Positioning System-based taxi scheduling system, which is described in this paper, aims to provide a decision support system for taxi drivers and facilitates direct information exchange between taxi drivers and passengers, while allowing drivers to remain independent. The taxi scheduling problem is considered to be a non-cooperative game between taxi drivers and a description of this problem is given. We adopt an efficient algorithm to discover a Nash equilibrium, such that each taxi driver and passenger cannot benefit from changing their assigned partner. Two computational examples are given to illustrate the effectiveness of the approach.


pdf

You can download the pdf of this publication from here


doi

The doi for this publication is 10.1057/jors.2013.96 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


Journal Rankings


ISI Web of Knowledge Journal Citation Reports

The Web of Knowledge Journal Citation Reports (often known as ISI Impact Factors) help measure how often an article is cited. You can get an introduction to Journal Citation Reports here. Below I have provided the ISI impact factor for the jourrnal in which this article was published. For complete information I have shown the ISI ranking over a number of years, with the latest ranking highlighted.

2014 (0.953), 2013 (0.911), 2012 (0.989), 2011 (0.971), 2010 (1.102), 2009 (1.009), 2008 (0.839), 2007 (0.784), 2006 (0.597), 2005 (0.603), 2004 (0.515), 2003 (0.416), 2002 (0.493), 2001 (0.438), 2000 (0.648)

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

@ARTICLE{blak2014, author = {R. Bai and J. Li and J.A.D. Atkin and G. Kendall},
title = {A novel approach to independent taxi scheduling problem based on stable matching},
journal = {Journal of the Operational Research Society},
year = {2014},
volume = {65},
pages = {1501--1510},
number = {10},
note = {Paper ISSN: 0160-5682 Electronic ISSN: 1476-9360},
abstract = {This paper describes a taxi scheduling system, which aims to improve the overall efficiency of the system, both from the perspective of the drivers and the customers. This is of particular relevance to Chinese cities, where hailing a taxi on the street is by far the most common way in which taxis are requested, since the majority of taxi drivers operate independently, rather than working for a company. The mobile phone and Global Positioning System-based taxi scheduling system, which is described in this paper, aims to provide a decision support system for taxi drivers and facilitates direct information exchange between taxi drivers and passengers, while allowing drivers to remain independent. The taxi scheduling problem is considered to be a non-cooperative game between taxi drivers and a description of this problem is given. We adopt an efficient algorithm to discover a Nash equilibrium, such that each taxi driver and passenger cannot benefit from changing their assigned partner. Two computational examples are given to illustrate the effectiveness of the approach.},
doi = {10.1057/jors.2013.96},
issn = {0160-5682},
keywords = {taxi scheduling, game theory, stable marriage problem, GPS, street hailing},
owner = {Graham},
timestamp = {2013.07.28},
webpdf = {http://www.graham-kendall.com/papers/blak2014.pdf} }