skip to main content
10.1145/3219819.3220055acmotherconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Route Recommendations for Idle Taxi Drivers: Find Me the Shortest Route to a Customer!

Published:19 July 2018Publication History

ABSTRACT

We study the problem of route recommendation to idle taxi drivers such that the distance between the taxi and an anticipated customer request is minimized. Minimizing the distance to the next anticipated customer leads to more productivity for the taxi driver and less waiting time for the customer. To anticipate when and where future customer requests are likely to come from and accordingly recom- mend routes, we develop a route recommendation engine called MDM: Minimizing Distance through Monte Carlo Tree Search. In contrast to existing techniques, MDM employs a continuous learning platform where the underlying model to predict future customer requests is dynamically updated. Extensive experiments on real taxi data from New York and San Francisco reveal that MDM is up to 70% better than the state of the art and robust to anomalous events such as concerts, sporting events, etc.

References

  1. Peter Auer, Nicolo Cesa-Bianchi, and Paul Fischer . 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning Vol. 47, 2--3 (2002), 235--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Prithu Banerjee, Sayan Ranu, and Sriram Raghavan . 2014. Inferring uncertain trajectories from partial observations ICDM. 30--39. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Prithu Banerjee, Pranali Yawalkar, and Sayan Ranu . 2016. Mantra: a scalable approach to mining temporally anomalous sub-trajectories SIGKDD. 1415--1424. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dan Donovan, Brian; Work . 2016. New York City Taxi Trip Data (2010--2013). (2016).Google ScholarGoogle Scholar
  5. Yong Ge, Hui Xiong, Alexander Tuzhilin, Keli Xiao, Marco Gruteser, and Michael Pazzani . 2010. An energy-efficient mobile recommender system. In SIGKDD. 899--908. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Levente Kocsis and Csaba Szepesvári . 2006. Bandit based monte-carlo planning. In European conference on machine learning. Springer, 282--293. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Vinay Kolar, Sayan Ranu, Anand Prabhu Subramainan, Yedendra Shrinivasan, Aditya Telang, Ravi Kokku, and Sriram Raghavan . 2014. People In Motion: Spatio-temporal Analytics on Call Detail Records COMSNETS. 1--4.Google ScholarGoogle Scholar
  8. Shubhadip Mitra, Sayan Ranu, Vinay Kolar, Aditya Telang, Arnab Bhattacharya, Ravi Kokku, and Sriram Raghavan . 2015. Trajectory aware macro-cell planning for mobile users INFOCOM. 792--800.Google ScholarGoogle Scholar
  9. Gabor Nagy and Saıd Salhi . 2005. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European journal of operational research Vol. 162, 1 (2005), 126--141.Google ScholarGoogle Scholar
  10. OpenStreetMap contributors . 2017. Planet dump retrieved from https://planet.osm.org . https://www.openstreetmap.org . (2017).Google ScholarGoogle Scholar
  11. Michal Piorkowski, Natasa Sarafijanovoc-Djukic, and Matthias Grossglauser . 2009. A Parsimonious Model of Mobile Partitioned Networks with Clustering COMSNETS. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Jason W Powell, Yan Huang, Favyen Bastani, and Minhe Ji . 2011. Towards reducing taxicab cruising time using spatio-temporal profitability maps. In International Symposium on Spatial and Temporal Databases. Springer, 242--260. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Meng Qu, Hengshu Zhu, Junming Liu, Guannan Liu, and Hui Xiong . 2014. A cost-effective recommender system for taxi drivers SIGKDD. 45--54. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Sayan Ranu, P Deepak, Aditya D Telang, Prasad Deshpande, and Sriram Raghavan . 2015. Indexing and matching trajectories under inconsistent sampling rates ICDE. 999--1010.Google ScholarGoogle Scholar
  15. Reuters . 2016. Uber debuts self-driving vehicles in landmark Pittsburgh trial. https://www.reuters.com/article/us-uber-autonomous/uber-debuts-self-driving-vehicles-in-landmark-pittsburgh -trial-idUSKCN11K12Y. (2016).Google ScholarGoogle Scholar
  16. Richard S Sutton and Andrew G Barto . 1998. Reinforcement learning: An introduction. Vol. Vol. 1. MIT press Cambridge. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. The-Straits-Times . 2016. World's first driverless taxi trial kicks off in Singapore. http://www.straitstimes.com/singapore/transport/worlds-first-driverless-taxi-trial-kicks-off-in-singapore. (2016).Google ScholarGoogle Scholar
  18. Tanvi Verma, Pradeep Varakantham, Sarit Kraus, and Hoong Chuin Lau . 2017. Augmenting Decisions of Taxi Drivers through Reinforcement Learning for Improving Revenues. In ICAPS, Vol. Vol. 27. 409--417.Google ScholarGoogle Scholar
  19. Huimin Wen, Jianping Sun, and Xi Zhang . 2014. Study on Traffic Congestion Patterns of Large City in China Taking Beijing as an Example. Procedia - Social and Behavioral Sciences Vol. 138 (2014), 482--491.Google ScholarGoogle ScholarCross RefCross Ref
  20. Jing Yuan, Yu Zheng, Chengyang Zhang, Wenlei Xie, Xing Xie, Guangzhong Sun, and Yan Huang . 2010. T-drive: driving directions based on taxi trajectories SIGSPATIAL. 99--108. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Jing Yuan, Yu Zheng, Liuhang Zhang, Xing Xie, and Guangzhong Sun . 2011. Where to find my next passenger. In 13th international conference on Ubiquitous computing. 109--118. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Yu Zheng, Yanchi Liu, Jing Yuan, and Xing Xie . 2011. Urban computing with taxicabs. In 13th international conference on Ubiquitous computing. 89--98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Yu Zheng, Jing Yuan, Wenlei Xie, Xing Xie, and Guangzhong Sun . 2010. Drive smartly as a taxi driver. In 7th international conference on autonomic & trusted computing. 484--486. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Route Recommendations for Idle Taxi Drivers: Find Me the Shortest Route to a Customer!

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        KDD '18: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
        July 2018
        2925 pages
        ISBN:9781450355520
        DOI:10.1145/3219819

        Copyright © 2018 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 19 July 2018

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        KDD '18 Paper Acceptance Rate107of983submissions,11%Overall Acceptance Rate1,133of8,635submissions,13%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader