Skip to main content
SpringerLink
Log in

Two-sided online bipartite matching in spatial data: experiments and analysis

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

With the rapid development of sharing economy and mobile Internet in recent years, a wide range of applications of the Two-sidedOnlineBipartiteMatching (TOBM) problem in spatial data are gaining increasing popularity. To be specific, given a group of workers and tasks that dynamically appear in a 2D space, the TOBM problem aims to find a matching with the maximum cardinality between workers and tasks satisfying the spatiotemporal constraints. Many works have studied this problem, but the settings of their problems are different from each other. Moreover, no prior works have compared the performances of the algorithms tailored for different settings under a unified definition. As a result, there lacks a guideline for practitioners to adopt appropriate algorithms for various scenarios. To fill the blank in this field, we present a comprehensive evaluation and analysis of the representative algorithms for the TOBM problem in this paper. We first give our unified definition and then provide uniform implementations for all the algorithms. Finally, based on the experimental results on both synthetic and real datasets, we discuss the strengths and weaknesses of the algorithms in terms of short-term effect and long-term effect, which can be guidance on selecting appropriate solutions or designing new methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. (1973) RE/MAX. http://www.remax.com

  2. (1999) Seamless. https://www.seamless.com

  3. (2009) Uber. https://www.uber.com

  4. (2010) Gigwalk. http://www.gigwalk.com

  5. (2012) DiDi Chuxing. https://www.didiglobal.com

  6. (2016) GAIA Open Dataset. https://outreach.didichuxing.com/research/opendata

  7. (2019) Source code and datasets. https://share.weiyun.com/5zX7DGs

  8. Burkard R E, Dell’Amico M, Martello S (2009) Assignment problems. SIAM

  9. Cao X, Chen L, Cong G, Jensen C S, Qu Q, Skovsgaard A, Wu D, Yiu ML (2012) Spatial keyword querying. In: ER, pp 16–29

  10. Chen L, Cong G (2015) Diversity-aware top-k publish/subscribe for text stream. In: SIGMOD, pp 347–362

  11. Chen L, Shi S, Lv J (2011) Efficient computation of measurements of correlated patterns in uncertain data. In: ADMA, pp 311–324

  12. Chen L, Cui Y, Cong G, Cao X (2014) SOPS: a system for efficient processing of spatial-keyword publish/subscribe. PVLDB 7(13):1601–1604

    Google Scholar 

  13. Chen L, Cong G, Cao X, Tan K (2015) Temporal spatial-keyword top-k publish/subscribe. In: ICDE, pp 255–266

  14. Chen L, Shang S, Zhang Z, Cao X, Jensen C S, Kalnis P (2018) Location-aware top-k term publish/subscribe. In: ICDE, pp 749–760

  15. Chen Z, Cong G, Zhang Z, Fu T Z J, Chen L (2017) Distributed publish/subscribe query processing on the spatio-textual data stream. In: ICDE, pp 1095–1106

  16. Cheng P, Jian X, Chen L (2018) An experimental evaluation of task assignment in spatial crowdsourcing. PVLDB 11(11):1428–1440

    Google Scholar 

  17. Deng D, Shahabi C, Demiryurek U (2013) Maximizing the number of worker’s self-selected tasks in spatial crowdsourcing. In: GIS, pp 314–323

  18. Dinitz Y (2006) Dinitz’ algorithm: the original version and even’s version. In: Theoretical computer science, essays in memory of Shimon even, pp 218–240

    Google Scholar 

  19. Edmonds J, Karp R M (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J ACM 19(2):248–264

    Article  Google Scholar 

  20. Gao D, Tong Y, She J, Song T, Chen L, Xu K (2017) Top-k team recommendation and its variants in spatial crowdsourcing. Data Sci Eng 2(2):136–150

    Article  Google Scholar 

  21. Han J, Wen J (2013) Mining frequent neighborhood patterns in a large labeled graph. In: CIKM, pp 259–268

  22. Han J, Wen J, Pei J (2014) Within-network classification using radius-constrained neighborhood patterns. In: CIKM, pp 1539–1548

  23. Han J, Zheng K, Sun A, Shang S, Wen J (2016) Discovering neighborhood pattern queries by sample answers in knowledge base. In: ICDE, pp 1014–1025

  24. Huang Z, Kang N, Tang Z G, Wu X, Zhang Y, Zhu X (2018) How to match when all vertices arrive online. In: STOC, pp 17–29

  25. Karp R M, Vazirani U V, Vazirani VV (1990) An optimal algorithm for on-line bipartite matching. In: STOC, pp 352–358

  26. Kazemi L, Shahabi C (2012) GeoCrowd: enabling query answering with spatial crowdsourcing. In: GIS, pp 189–198

  27. Kuhn H W (1955) The hungarian method for the assignment problem. Nav Res Logist Q 2(1–2):83–97

    Article  Google Scholar 

  28. Liu A, Wang W, Shang S, Li Q, Zhang X (2018) Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22 (2):335–362

    Article  Google Scholar 

  29. Liu Y, Guo B, Du H, Yu Z, Zhang D, Chen C (2017) Poster: Foodnet: optimized on demand take-out food delivery using spatial crowdsourcing. In: MobiCom, pp 564–566

  30. Mehta A (2013) Online matching and ad allocation. Found Trends Theoret Comput Sci 8(4):265–368

    Article  Google Scholar 

  31. Shang S, Chen L, Wei Z, Jensen C S, Wen J, Kalnis P (2016) Collective travel planning in spatial networks. IEEE Trans Knowl Data Eng 28(5):1132–1146

    Article  Google Scholar 

  32. Shang S, Chen L, Jensen C S, Wen J, Kalnis P (2017) Searching trajectories by regions of interest. IEEE Trans Knowl Data Eng 29(7):1549–1562

    Article  Google Scholar 

  33. Shang S, Chen L, Wei Z, Jensen C S, Zheng K, Kalnis P (2017) Trajectory similarity join in spatial networks. PVLDB 10(11):1178–1189

    Google Scholar 

  34. Shang S, Chen L, Wei Z, Jensen C S, Zheng K, Kalnis P (2018) Parallel trajectory similarity joins in spatial networks. VLDB J 27(3):395–420

    Article  Google Scholar 

  35. Shang S, Chen L, Zheng K, Jensen C S, Wei Z, Kalnis P (2018) Parallel trajectory-to-location join. IEEE Trans Knowl Data Eng 30(1):1–1

  36. She J, Tong Y, Chen L, Cao C C (2016) Conflict-aware event-participant arrangement and its variant for online setting. IEEE Trans Knowl Data Eng 28 (9):2281–2295

    Article  Google Scholar 

  37. Song T, Tong Y, Wang L, She J, Yao B, Chen L, Xu K (2017) Trichromatic online matching in real-time spatial crowdsourcing. In: ICDE, pp 1009–1020

  38. Tong Y, Zhou Z (2018) Dynamic task assignment in spatial crowdsourcing. SIGSPATIAL Special 10(2):18–25

    Article  Google Scholar 

  39. Tong Y, She J, Ding B, Chen L, Wo T, Xu K (2016) Online minimum matching in real-time spatial data: experiments and analysis. PVLDB 9(12):1053–1064

    Google Scholar 

  40. Tong Y, She J, Ding B, Wang L, Chen L (2016) Online mobile micro-task allocation in spatial crowdsourcing. In: ICDE, pp 49–60

  41. Tong Y, Chen L, Shahabi C (2017) Spatial crowdsourcing: challenges, techniques, and applications. PVLDB 10(12):1988–1991

    Google Scholar 

  42. Tong Y, Chen Y, Zhou Z, Chen L, Wang J, Yang Q, Ye J, Lv W (2017) The simpler the better: a unified approach to predicting original taxi demands based on large-scale online platforms. In: KDD, pp 1653–1662

  43. Tong Y, Wang L, Zhou Z, Ding B, Chen L, Ye J, Xu K (2017) Flexible online task assignment in real-time spatial data. PVLDB 10(11):1334–1345

    Google Scholar 

  44. Tong Y, Chen L, Zhou Z, Jagadish H V, Shou L, Lv W (2018) SLADE: a smart large-scale task decomposer in crowdsourcing. IEEE Trans Knowl Data Eng 30(8):1588–1601

    Article  Google Scholar 

  45. Tong Y, Wang L, Zhou Z, Chen L, Du B, Ye J (2018) Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: SIGMOD, pp 773–788

  46. Wang Y, Wong S C (2015) Two-sided online bipartite matching and vertex cover: beating the greedy algorithm. In: ICALP, pp 1070–1081

  47. Zeng Y, Tong Y, Chen L, Zhou Z (2018) Latency-oriented task completion via spatial crowdsourcing. In: ICDE, pp 317–328

  48. Zhang L, Hu T, Min Y, Wu G, Zhang J, Feng P, Gong P, Ye J (2017) A taxi order dispatch model based on combinatorial optimization. In: KDD, pp 2151–2159

Download references

Author information

Authors and Affiliations

  1. SKLSDE Lab, School of Computer Science and Engineering and IRI, Beihang University, Beijing, China

    Yiming Li, Jingzhi Fang & Yongxin Tong

  2. Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Hong Kong SAR, China

    Yuxiang Zeng

  3. Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich, Switzerland

    Balz Maag

  4. Didi Chuxing, Beijing, China

    Lingyu Zhang

Authors
  1. Yiming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingzhi Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuxiang Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Balz Maag
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yongxin Tong
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Lingyu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yongxin Tong.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, Y., Fang, J., Zeng, Y. et al. Two-sided online bipartite matching in spatial data: experiments and analysis. Geoinformatica 24, 175–198 (2020). https://doi.org/10.1007/s10707-019-00359-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-019-00359-w

Keywords

Search

Navigation