Skip to main content
SpringerLink
Log in

Big Data-Driven Stable Task Allocation in Ride-Hailing Services

  • Conference paper
  • First Online:
Database Systems for Advanced Applications. DASFAA 2022 International Workshops (DASFAA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13248))

Included in the following conference series:

  • 1121 Accesses

Abstract

Ride-hailing is important for urban transportation and greatly improves the efficiency of public transportation. In the ride-hailing platform, it is a core work to match the passengers and drivers scientifically and quickly. The interests of passengers, drivers and the platform should all be considered in the task assignment process. We first proposed a baseline algorithm which can satisfy stable matching, but the global pickup distance (the total distance of all taxis to pick up passengers) is relatively large, so we invented a chain algorithm which can optimize the global pickup distance, and the most of the results satisfy stable matching at the same time. Moreover, we verified the practical effect of this algorithm through experiments.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. To, H., Fan, L., Tran, L., Shahabi, C.: Real-time task assignment in hyperlocal spatial crowdsourcing under budget constraints. In: 2016 IEEE International Conference on Pervasive Computing and Communications, Piscataway, NJ, pp. 1–8. IEEE (2016)

    Google Scholar 

  2. Tran, L., To, H., Fan, L., Shahabi, C.: A real-time framework for task assignment in hyperlocal spatial crowdsourcing. ACM Trans. Intell. Syst. Technol. 9(3), 37 (2018)

    Article  Google Scholar 

  3. Zhao, B., Xu, P., Shi, Y., Tong, Y., Zhou, Z., Zeng, Y.: Preference-aware task assignment in on-demand taxi dispatching: an online stable matching approach. In: Proceedings of the AAAI Conference on Artificial Intelligence, Menlo Park, pp. 2245–2252. AAAI (2019)

    Google Scholar 

  4. Fenoaltea, E.M., Baybusinov, I.B., Zhao, J., Zhou, L., Zhang, Y.-C.: The stable marriage problem: an interdisciplinary review from the physicist’s perspective. Phys. Rep. 917, 1–79 (2021)

    Article  MathSciNet  Google Scholar 

  5. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Weihe, K.: Network flows: theory, algorithms and applications. ZOR-Methods Models Oper. Res. 41(3), 252–254 (1995)

    Google Scholar 

  6. Long, C., Wong, R.C.-W., Yu, P.S., Jiang, M.: On optimal worst-case matching. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 845–856. ACM, New York (2013)

    Google Scholar 

  7. Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowd-sourcing. In: Proceedings of the 32nd International Conference on Data Engineering, Piscataway, pp. 49–60. IEEE (2016)

    Google Scholar 

  8. Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Ke, X.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)

    Article  Google Scholar 

  9. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9–15 (1962)

    Article  MathSciNet  Google Scholar 

  10. Gusfield, D., Irving, R.W.: The Stable Marriage Problem-Structure and Algorithms. Foundations of Computing Series, MIT Press, Cambridge (1989)

    MATH  Google Scholar 

  11. David, M.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)

    Google Scholar 

  12. Lee, H.: Online stable matching as a means of allocating distributed resources. J. Syst. Archit. 45(15), 1345–1355 (1999)

    Article  Google Scholar 

  13. Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255–267 (1994)

    Article  MathSciNet  Google Scholar 

  14. Huzhang, G., Huang, X., Zhang, S., Bei, X.: Online roommate allocation problem. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, Menlo Park, pp. 235–241. AAAI (2017)

    Google Scholar 

  15. Wong, R.C.-W., Tao, Y., Fu, A.W.-C., Xiao, X.: On efficient spatial matching. In: Proceedings of the 33rd International Conference on Very Large Data Bases. VLDB Endowment, Trondheim, Norway, pp. 579–590 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Beihang University, Beijing, 100191, China

    Jingwei Lv, Nan Zhou & Shuzhen Yao

Authors
  1. Jingwei Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuzhen Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nan Zhou .

Editor information

Editors and Affiliations

  1. University of Aizu, Aizu, Japan

    Uday Kiran Rage

  2. Indraprastha Institute of Information Technology, Delhi, India

    Vikram Goyal

  3. Data Sciences and Analytics Center, International Institute of Information Technology, Hyderabad, Telangana, India

    P. Krishna Reddy

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lv, J., Zhou, N., Yao, S. (2022). Big Data-Driven Stable Task Allocation in Ride-Hailing Services. In: Rage, U.K., Goyal, V., Reddy, P.K. (eds) Database Systems for Advanced Applications. DASFAA 2022 International Workshops. DASFAA 2022. Lecture Notes in Computer Science, vol 13248. Springer, Cham. https://doi.org/10.1007/978-3-031-11217-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-11217-1_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-11216-4

  • Online ISBN: 978-3-031-11217-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation