Skip to main content
SpringerLink
Log in

Stable two-sided satisfied matching for ridesharing system based on preference orders

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

Abstract

Ridesharing has emerged as an alternative transportation mode along road networks around the world. Rideshare matching problem is vital to improve the sustainable development of ridesharing systems. This paper aims to address the stable two-sided satisfied matching problem considering the participants’ psychological perception. First of all, we investigate the elements that influence passengers’ and drivers’ ridesharing experience by means of semi-structured research interviews and questionnaire survey. Two ridesharing perception evaluation systems are originally established to get the preference orders of passengers and drivers separately. Then, rideshare matching-related definitions are stated and rideshare matching linguistic information processing is also elaborated in detail based on preference utility function, disappointment function, as well as elation function. Furthermore, we propose a stable two-sided satisfied matching model on account of fuzzy linguistic information processing about ridesharing, which is able to reflect participants’ psychological factors. To verify the validity of our model, we present a two-sided matching case based on hypothetical rideshare matching platform. The analytical results indicate that the use of stable two-sided satisfied matching method based on fuzzy linguistic information enables to substantially satisfy both drivers’ and passengers’ expectation and improve the sustainability of ridesharing systems.

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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Afshari AR, Yusuff RM, Derayatifar AR (2013) Linguistic extension of fuzzy integral for group personnel selection problem. Arab J Sci Eng 38(10):2901–2910

    Article  Google Scholar 

  2. Agatz N, Erera AL, Savelsbergh MW, Wang X (2011) Dynamic ride-sharing: a simulation study in metro Atlanta. Procedia-Social Behav Sci 17:532–550

    Article  Google Scholar 

  3. Alpern S, Katrantzi I (2009) Equilibria of two-sided matching games with common preferences. Eur J Oper Res 196(3):1214–1222

    Article  MathSciNet  Google Scholar 

  4. Chan ND, Shaheen SA (2012) Ridesharing in north America: past, present, and future. Transp Rev 32(1):93–112

    Article  Google Scholar 

  5. Delquié P, Cillo A (2006) Disappointment without prior expectation: a unifying perspective on decision under risk. J Risk Uncertain 33(3):197–215

    Article  Google Scholar 

  6. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9–15

    Article  MathSciNet  Google Scholar 

  7. Ghiselli EE, Campbell JP, Zedeck S (1981) Measurement theory for the behavioral sciences. A series of books in psychology. WH Freeman, San Francisco

    Google Scholar 

  8. Gu Y, Saad W, Bennis M, Debbah M, Han Z (2015) Matching theory for future wireless networks: fundamentals and applications. IEEE Commun Mag 53(5):52–59

    Article  Google Scholar 

  9. Hall RW, Qureshi A (1997) Dynamic ride-sharing: theory and practice. J Transp Eng 123(4):308–315

    Article  Google Scholar 

  10. Hałaburda H (2010) Unravelling in two-sided matching markets and similarity of preferences. Games Econ Behav 69(2):365–393

    Article  MathSciNet  Google Scholar 

  11. Herbawi W, Weber M (2012) The ride-matching problem with time windows in dynamic ridesharing: a model and a genetic algorithm. In: Evolutionary Computation (CEC) 2012 IEEE Congress, pp 1–8

  12. Herrera F, Herrera-Viedma E, Verdegay JL (1996) Direct approach processes in group decision making using linguistic OWA operators. Fuzzy Sets Syst 79(2):175–190

    Article  MathSciNet  Google Scholar 

  13. Herrera F, Herrera-Viedma E (2000) Choice functions and mechanisms for linguistic preference relations. Eur J Oper Res 120(1):144–161

    Article  MathSciNet  Google Scholar 

  14. Hinkin TR (1998) A brief tutorial on the development of measures for use in survey questionnaires. Organ Res Methods 1(1):104–121

    Article  Google Scholar 

  15. Jiang ZZ, Fan ZP, Tan CQ, Yuan Y (2011) A matching approach for one-shot multi-attribute exchanges with incomplete weight information in E-brokerage. Int J Innov Comput Inf Control 7(5):2623–2636

    Google Scholar 

  16. Jiang ZZ, Ip WH, Lau HC, Fan ZP (2011) Multi-objective optimization matching for one-shot multi-attribute exchanges with quantity discounts in E-brokerage. Exp Syst Appl 38(4):4169–4180

    Article  Google Scholar 

  17. Kamar E, Horvitz E (2009) Collaboration and shared plans in the open world: studies of ridesharing. In: Twenty-First International Joint Conference on Artificial Intelligence, vol 9, pp 187–189

  18. Kleiner A, Nebel B, Ziparo VA (2011) A mechanism for dynamic ride sharing based on parallel auctions. Twenty-Second International Joint Conference on Artificial Intelligence, vol 11, pp 266–272

  19. Kojima F, Pathak PA (2009) Incentives and stability in large two-sided matching markets. Am Econ Rev 99(3):608–627

    Article  Google Scholar 

  20. Lee A, Savelsbergh M (2015) Dynamic ridesharing: is there a role for dedicated drivers? Transp Res Part B Methodol 81:483–497

    Article  Google Scholar 

  21. Martinez LM, Correia GH, Viegas JM (2015) An agent-based simulation model to assess the impacts of introducing a shared-taxi system: an application to Lisbon (Portugal). J Adv Transp 49(3):475–495

    Article  Google Scholar 

  22. McVitie DG, Wilson LB (1970) Stable marriage assignment for unequal sets. BIT Numer Math 10(3):295–309

    Article  Google Scholar 

  23. Qi Y, Fan ZP (2012) Research on two-sided matching decision problems based on pessimism degree. J Manag Sci 25(2):112–120

    Google Scholar 

  24. Roth AE, Sotomayor M (1989) The college admissions problem revisited. Econom J Econom Soc 57(3):559–570

    MathSciNet  MATH  Google Scholar 

  25. Roth AE (2008) Deferred acceptance algorithms: history, theory, practice, and open questions. Int J Game Theory 36(3–4):537–569

    Article  MathSciNet  Google Scholar 

  26. Sengupta A, Pal TK (2000) On comparing interval numbers. Eur J Oper Res 127(1):28–43

    Article  MathSciNet  Google Scholar 

  27. 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 

  28. Tahmasseby S, Kattan L, Barbour B (2016) Propensity to participate in a peer-to-peer social-network-based carpooling system. J Adv Transp 50(2):240–254

    Article  Google Scholar 

  29. Thaithatkul P, Seo T, Kusakabe T, Asakura Y (2015) A passengers matching problem in ridesharing systems by considering user preference. J East Asia Soc Transp Stud 11:1416–1432

    Google Scholar 

  30. Toroslu IH, Arslanoglu Y (2007) Genetic algorithm for the personnel assignment problem with multiple objectives. Inf Sci 177(3):787–803

    Article  MathSciNet  Google Scholar 

  31. Wang X, Agatz N, Erera A (2017) Stable matching for dynamic ride-sharing systems. Transp Sci 52(4):850–867

    Article  Google Scholar 

  32. Xu H, Ordóñez F, Dessouky M (2015) A traffic assignment model for a ridesharing transportation market. J Adv Transp 49(7):793–816

    Article  Google Scholar 

  33. Yılmaz Ö (2011) Kidney exchange: an egalitarian mechanism. J Econ Theory 146(2):592–618

    Article  MathSciNet  Google Scholar 

  34. Yousaf J, Li J, Chen L, Tang J, Dai X (2014) Generalized multipath planning model for ride-sharing systems. Front Comput Sci 8(1):100–118

    Article  MathSciNet  Google Scholar 

  35. Yotsutsuji H, Sasaki K, Yamamoto M (2013) Availability of volunteer-based dynamic ridesharing with bipartite group in a low-density small community in Japan. J East Asia Soc Transp Stud 10:1009–1024

    Google Scholar 

  36. Zhuang SC, Boonen TJ, Tan KS, Xu ZQ (2017) Optimal insurance in the presence of reinsurance. Scand Actuar J 6:535–554

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author(s) received financial support of research funds from Innovative Spark Project of Sichuan University (No. 2019hhs-15), Sichuan Tourism Development and Research Centre Project (No. LYC16-16), Next-Generation Internet Technology Innovation Project (No. NGII20151207) and China Scholarship Council (No. 201606240014), National Natural Science Foundation of China (Nos. 71371130, 71302134).

Author information

Authors and Affiliations

  1. Business School, Sichuan University, No. 24 Southern Yihuan Road, Chengdu, 610064, China

    Rong Zhao & Maozhu Jin

  2. School of Information and Engineering, Sichuan Tourism University, No. 459, Hongling Road, Longquanyi District, Chengdu, 610000, China

    Peiyu Ren

  3. Economic and Management School, Chengdu Agricultural College, Chengdu, 611130, China

    Qian Zhang

Authors
  1. Rong Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maozhu Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peiyu Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qian Zhang.

Additional information

Publisher's Note

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

Electronic supplementary material

Below is the link to the electronic supplementary material.

Supplementary material 1 (PDF 150 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, R., Jin, M., Ren, P. et al. Stable two-sided satisfied matching for ridesharing system based on preference orders. J Supercomput 76, 1063–1081 (2020). https://doi.org/10.1007/s11227-020-03173-6

Download citation

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation