Skip to main content
Springer Nature Link
Log in

High-capacity ride-sharing via shortest path clustering on large road networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Ride-sharing has been widely studied in academia and applied in mobility-on-demand systems as a means of reducing the number of cars, congestion, and pollution by sharing empty seats. Solving this problem is challenging on large-scale road networks for the following two reasons: Distance calculation on large-scale road networks is time-consuming, and multi-request allocation and route planning have been proved to be NP-hard problems. In this paper, we propose a clustering-based request matching and route planning algorithm \({Roo}\) whose basic operations are merging requested trips on road networks. Several requested trips can be merged and served by a vehicle if their shortest paths from origins to destinations are close to each other based on spatiotemporal road network distances. The resultant routes are further refined by introducing meeting points, which can shorten the total traveling distance while keeping matched ride requests satisfied. The \({Roo}\) algorithm has been evaluated with two real-world taxi trajectory datasets and road networks from New York City and Beijing. The results show that \({Roo}\) can save up to 50% of mileage by 1000 vehicles serving around 7000 trip requests in New York City between 7:40 and 8:00 am with an average waiting time of 4 minutes.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Notes

  1. The XOR operation can be expressed by a set of linear inequalities. E.g. \(z = x_1 \oplus x_2\) is equivalent to \(z \le x_1 + x_2\),   \(z \ge x_1 - x_2\),   \(z \ge x_2 - x_1\),   \(z \le 2 - x_1 - x_2\),    \(z, x_1, x_2 \in \{0,1\}\).

References

  1. Agatz N, Erera A, Savelsbergh M, Wang X (2011) Dynamic ride-sharing: a simulation study in metro atlanta. Procedia—social and behavioral sciences. In: Papers selected for the 19th International Symposium on Transportation and Traffic Theory 17:532–550

  2. Agatz N, Erera A, Savelsbergh M, Wang X (2012) Optimization for dynamic ride-sharing: a review. Eur J Oper Res 223(2):295–303

    Article  Google Scholar 

  3. Alonso-Mora J, Samaranayake S, Wallar A, Frazzoli E, Rus D (2017) On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc Natl Acad Sci 114(3):462–467

    Article  Google Scholar 

  4. Bastani F, Xie X, Huang Y, Powell JW (2011) A greener transportation mode: flexible routes discovery from GPS trajectory data. In: 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2011, November 1-4, 2011, Chicago, IL, USA, Proceedings, pp 405–408

  5. Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8–15

    Article  Google Scholar 

  6. Cao L, Krumm J (2009) From gps traces to a routable road map. In: GIS, New York, NY, USA. ACM, pp 3–12

  7. Carrion C, Levinson D (2012) Value of travel time reliability: a review of current evidence. Transp Res Part A Policy Pract 46(4):720–741

    Article  Google Scholar 

  8. Chen C, Zhang D, Li N, Zhou Z-H (2014) B-planner: planning bidirectional night bus routes using large-scale taxi gps traces. IEEE Trans Intell Transp Syst 15(4):1451–1465

    Article  Google Scholar 

  9. Chuah SP, Wu H, Lu Y, Yu L, Bressan S (2016) Bus routes design and optimization via taxi data analytics. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, ACM, pp 2417–2420

  10. Fan W, Machemehl RB (2004) Optimal transit route network design problem: algorithms, implementations, and numerical results. Technical report

  11. Gaffney S, Smyth P (1999) Trajectory clustering with mixtures of regression models. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 15-18, 1999, pp 63–72

  12. Gidofalvi G, Pedersen TB, Risch T, Zeitler E (2008) Highly scalable trip grouping for large-scale collective transportation systems. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, EDBT’08, New York, NY, USA. ACM, pp 678–689

  13. Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin

    Book  Google Scholar 

  14. Hennessy DA, Wiesenthal DL (1999) Traffic congestion, driver stress, and driver aggression. Aggress Behav Off J Int Soc Res Aggress 25(6):409–423

    Article  Google Scholar 

  15. Huang Y, Bastani F, Jin R, Wang XS (2014) Large scale real-time ridesharing with service guarantee on road networks. Proc VLDB Endow 7(14):2017–2028

    Article  Google Scholar 

  16. Jensen CS, Lin D, Ooi BC (2007) Continuous clustering of moving objects. IEEE Trans Knowl Data Eng 19(9):1161–74

    Article  Google Scholar 

  17. Lee J-G, Han J, Whang K-Y (2007) Trajectory clustering: a partition-and-group framework. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, ACM, pp 593–604

  18. Li Y, Han J, Yang J (2004) Clustering moving objects. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp 617–622

  19. Ma S, Zheng Y, Wolfson O (2013) T-share: a large-scale dynamic taxi ridesharing service. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), IEEE, pp 410–421

  20. Mahin MT, Hashem T (2019) Activity-aware ridesharing group trip planning queries for flexible POIs. ACM Trans Spatial Algorithms Syst 5(3):1–41

    Article  Google Scholar 

  21. Pant P, Harrison RM (2013) Estimation of the contribution of road traffic emissions to particulate matter concentrations from field measurements: a review. Atmosp Environ 77:78–97

    Article  Google Scholar 

  22. Pattnaik SB, Mohan S, Tom VM (1998) Urban bus transit route network design using genetic algorithm. J Transp Eng 124(4):368–375

    Article  Google Scholar 

  23. Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11

    Article  MathSciNet  Google Scholar 

  24. Qian X, Zhang W, Ukkusuri SV, Yang C (2017) Optimal assignment and incentive design in the taxi group ride problem. Transp Res Part B Methodol 103:208–226

    Article  Google Scholar 

  25. Santi P, Resta G, Szell M, Sobolevsky S, Strogatz SH, Ratti C (2014) Quantifying the benefits of vehicle pooling with shareability networks. Proc Natl Acad Sci 111(37):13290–13294

    Article  Google Scholar 

  26. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4(1):285–305

    Article  MathSciNet  Google Scholar 

  27. Shen B, Huang Y, Zhao Y (2016) Dynamic ridesharing. SIGSPATIAL Spec 7(3):3–10

    Article  Google Scholar 

  28. Shen B, Zhao Y, Li G, Zheng W, Qin Y, Yuan B, Rao Y (2017) V-tree: efficient knn search on moving objects with road-network constraints. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), IEEE, pp 609–620

  29. Shrivastava P, O’Mahony M (2007) Design of feeder route network using combined genetic algorithm and specialized repair heuristic. J Publ Transp 10(2):109–133

    Article  Google Scholar 

  30. Stiglic M, Agatz N, Savelsbergh M, Gradisar M (2015) The benefits of meeting points in ride-sharing systems. Transp Res Part B Methodol 82:36–53

    Article  Google Scholar 

  31. Ta N, Li G, Zhao T, Feng J, Ma H, Gong Z (2018) An efficient ride-sharing framework for maximizing shared route. IEEE Trans Knowl Data Eng 30(2):219–233

    Article  Google Scholar 

  32. Tang L, Duan Z, Zhu Y, Ma J, Liu Z (2019) Recommendation for ridesharing groups through destination prediction on trajectory data. IEEE Trans Intell Transp Syst:1–14

  33. Vazifeh MM, Santi P, Resta G, Strogatz SH, Ratti C (2018) Addressing the minimum fleet problem in on-demand urban mobility. Nature 557(7706):534–538

    Article  Google Scholar 

  34. Wang Y, Kutadinata R, Winter S (2019) The evolutionary interaction between taxi-sharing behaviours and social networks. Transp Res Part A Policy Pract 119:170–180

    Article  Google Scholar 

  35. Zhao F, Ubaka I (2004) Transit network optimization-minimizing transfers and optimizing route directness. J Publ Transp 7(1):4

    Article  Google Scholar 

  36. Zhu M, Liu X-Y, Tang F, Qiu M, Shen R, Shu W, Min-You W (2016) Public vehicles for future urban transportation. IEEE Trans Intell Transp Syst 17(12):3344–3353

    Article  Google Scholar 

  37. Zhu M, Liu X-Y, Wang X (2019) An online ride-sharing path-planning strategy for public vehicle systems. IEEE Trans Intell Transp Syst 20(2):616–627

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, Beijing, China

    Haojia Zuo, Bo Cao, Ying Zhao, Bilong Shen & Weimin Zheng

  2. Department of Computer Science, University of North Texas, Denton, TX, USA

    Yan Huang

Authors
  1. Haojia Zuo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Bo Cao
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ying Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Bilong Shen
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Weimin Zheng
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Yan Huang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ying Zhao.

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

Zuo, H., Cao, B., Zhao, Y. et al. High-capacity ride-sharing via shortest path clustering on large road networks. J Supercomput 77, 4081–4106 (2021). https://doi.org/10.1007/s11227-020-03424-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-020-03424-6

Keywords