Abstract
Recommending routes with the shortest cruising distance based on big taxi trajectories is an active research topic. In this paper, we first introduce a temporal probability grid network generated from the taxi trajectories, then a profitable route recommendation algorithm called Adaptive Shortest Expected Cruising Route (ASECR) algorithm is proposed. ASECR recommends profitable routes based on assigned potential profitable grids and updates the profitable route constantly based on taxis’ movements as well as utilizing the temporal probability grid network dynamically. To handle the big trajectory data and improve the efficiency of updating route constantly, a data structure kdS-tree is proposed and implemented for ASECR. The experiments on two real taxi trajectory datasets demonstrate the effectiveness and efficiency of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schaller Consulting: The New York City Taxicab Fact Book, Schaller Consulting, Brooklyn, NY (2006). http://www.schallerconsult.com/taxi/taxifb.pdf
Hunter, T., Herring, R., Abbeel, P., Bayen, A.: Path and travel time inference from GPS probe vehicle data. In: Proc. Neural Information Processing Systems (NIPS). New York, USA, pp. 316–324 (2009)
Ge, Y., Xiong, H., Alexander, T., Xiao, K., Marco, G., Michael, P.: An energy-efficient mobile recommender system. In: Proc. Knowledge Discovery and Data Mining, KDD 2010. Washington, DC, pp. 899–908 (2010)
Yamamoto, K., Uesugi, K., Watanabe, Y.: Adaptive routing of cruising taxis by mutual exchange of pathways. In: Proc. Knowledge-Based Intelligent Information and Engineering Systems. Zagreb, Croatia, pp. 559–566 (2008)
Powell, J.W., Huang, Y., Bastani, F., Ji, M,: Towards reducing taxi time using spatio-temporal profitability maps. In: Proc. Advances in Spatial and Temporal Databases. Minneapolis, MN, USA, pp. 242–260 (2011)
Yuan, J., Zhen, Y., Zhang, L., Xie, X., Sun, G.: Where to find my next passenger? In: Proc. Ubiquitous Computing. Beijing, China, pp. 109–118 (2011)
Ma, S., Zheng, Y., Wolfson, O.: T-share: A large-scale dynamic taxi ridesharing service. In: Proc. Data Engineering Brisbane, Australia, pp. 410–421 (2013)
Long, C., Wong, R.C.W., Jagadish, H.V.: Direction-preserving trajectory simplification. In: Proc. the VLDB Endowment, pp. 949–960 (2013)
Zhang, D., He, Y.: pCruise: reducing cruising miles for taxicab networks. In: Proc. Real-Time Systems Symposium. San Juan, PR, USA, pp. 85–94 (2012)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. In: Communications of the ACM, pp. 509–517 (1975)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. Management of Data, pp. 47–57 (1984). Agrawal, D., Bernstein, P., Bertino, E.: Challenges and opportunities with big data (2012). http://www.cra.org/ccc/files/docs/init/bigdatawhitepaper.pdf
Omohundro, S.M.: Five balltree construction algorithms. In: ICSI Technical Report (1989)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: Proc. Management of Data, San Jose, CA, pp. 71–79 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yang, W., Wang, X., Rahimi, S.M., Luo, J. (2015). Recommending Profitable Taxi Travel Routes Based on Big Taxi Trajectories Data. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9078. Springer, Cham. https://doi.org/10.1007/978-3-319-18032-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-18032-8_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18031-1
Online ISBN: 978-3-319-18032-8
eBook Packages: Computer ScienceComputer Science (R0)