Online Cruising Mile Reduction in Large-Scale Taxicab Networks

Desheng Zhang, Tian He, Shan Lin, Sirajum Munir, John A. Stankovic

Research output: Contribution to journalArticlepeer-review

20 Scopus citations


In the taxicab industry, a long-standing challenge is how to reduce taxicabs' miles spent without fares, i.e., cruising miles. The current solutions for this challenge usually depend on passengers to actively provide their locations in advance for pickups. To address this challenge without the burden on passengers, in this paper, we propose a cruising system, pCruise , for taxicab drivers to find efficient routes to pick up passengers to reduce cruising miles. According to the real-time pick-up events from nearby taxicabs, pCruise characterizes a cruising process with a cruising graph, and assigns weights on edges of the cruising graph to indicate the utility of cruising corresponding road segments. Our weighting process considers the number of nearby passengers and taxicabs together in real-time, aiming at two scenarios where taxicabs are explicitly or implicitly coordinated with each other. Based on a weighted cruising graph, when a taxicab becomes vacant, pCruise provides a distributed online scheduling strategy to obtain and update an efficient cruising route with the minimum length and at least one arriving passenger. We evaluate pCruise based on a real-world GPS dataset from a Chinese city Shenzhen with 14,000 taxicabs. The evaluation results show that pCruise assists taxicab drivers to reduce cruising miles by 42 percent on average.

Original languageEnglish (US)
Article number6930792
Pages (from-to)3122-3135
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number11
StatePublished - Nov 1 2015

Bibliographical note

Publisher Copyright:
© 1990-2012 IEEE.


  • Cruising Mile Reduction
  • Dispatching
  • Taxicab Network


Dive into the research topics of 'Online Cruising Mile Reduction in Large-Scale Taxicab Networks'. Together they form a unique fingerprint.

Cite this