An online fastest-path recommender system

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents an online traffic system to recommend taxi drivers the fastest-path of picking passengers up. Several systems have been studied to find and recommend the shortest-paths on distance in mobile scenarios. However, in practical traffics, we discover that the shortest-path is usually not the fastest-path due to congestion. Especially for the taxi drivers, the fastest-path to pick up passengers is the best choice. Analyzing a real trace data including about 2000 taxis in a 22 square kilometers area in 7 days in Shanghai. Then we design a practical recommendation system to process the fastest-path selection. Experimental results show that our online system can quickly recommend the almost exact fastest-paths to taxi drivers for picking up passengers in real traces. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Xun, Y., & Xue, G. (2011). An online fastest-path recommender system. In Advances in Intelligent and Soft Computing (Vol. 123, pp. 341–348). https://doi.org/10.1007/978-3-642-25661-5_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free