A novel approach to independent taxi scheduling problem based on stable matching

Ruibin Bai, Jiawei Li, Jason A.D. Atkin, Graham Kendall

Research output: Journal PublicationArticlepeer-review

42 Citations (Scopus)
42 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)1501-1510
Number of pages10
JournalJournal of the Operational Research Society
Issue number10
Publication statusPublished - Oct 2014


  • GPS
  • game theory
  • stable marriage problem
  • street hailing
  • taxi scheduling

ASJC Scopus subject areas

  • Statistics, Probability and Uncertainty
  • Modelling and Simulation
  • Strategy and Management
  • Management Science and Operations Research


Dive into the research topics of 'A novel approach to independent taxi scheduling problem based on stable matching'. Together they form a unique fingerprint.

Cite this