Skip to main content
SpringerLink
Log in

Stable ride-sharing matching for the commuters with payment design

  • Published:
Transportation Aims and scope Submit manuscript

Abstract

Ride-sharing enables reduction of private car usage for commuting. This paper proposes a stable matching model for the ride-sharing which aims to minimize the travel cost of all commuters. A payment for the ride-sharing is designed considering the equity and incentive. An algorithm based on the deferred acceptance algorithm is proposed for the model. To verify the model and algorithm, cases with different scales are presented based on Dalian. The results illustrate that the compensation, time window and driver-to-rider ratios can affect the successful matching rate.

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

Similar content being viewed by others

References

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

    Google Scholar 

  • Agatz, N.A., Erera, A.L., Savelsbergh, M.W., Wang, X.: Dynamic ride-sharing: a simulation study in metro Atlanta. Transp. Res. Part B Methodol. 45(9), 1450–1464 (2011)

    Google Scholar 

  • Alkan, A., Gale, D.: Stable schedule matching under revealed preference. J. Econ. Theory 112(2), 289–306 (2003)

    Google Scholar 

  • Bai, R., Li, J., Atkin, J.A., Kendall, G.: A novel approach to independent taxi scheduling problem based on stable matching. J. Oper. Res. Soc. 65(10), 1501–1510 (2014)

    Google Scholar 

  • Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on lagrangean column generation. Oper. Res. 52(3), 422–439 (2004)

    Google Scholar 

  • Brownstone, D., Golob, T.F.: The effectiveness of ridesharing incentives: discrete-choice models of commuting in Southern California. Reg. Sci. Urban Econ. 22(1), 5–24 (1992)

    Google Scholar 

  • Chan, N.D., Shaheen, S.A.: Ridesharing in north america: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)

    Google Scholar 

  • Charles, K.K., Kline, P.: Relational costs and the production of social capital: evidence from carpooling. Econ. J. 116(511), 581–604 (2006)

    Google Scholar 

  • Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)

    Google Scholar 

  • Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B Methodol. 37(6), 579–594 (2003)

    Google Scholar 

  • Eeckhout, J.: On the uniqueness of stable marriage matchings. Econ. Lett. 69(1), 1–8 (2000)

    Google Scholar 

  • Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.E., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B Methodol. 57, 28–46 (2013)

    Google Scholar 

  • Furuhata, M., Daniel, K., Koenig, S., Ordonez, F., Dessouky, M., Brunet, M.E., Wang, X.: Online cost-sharing mechanism design for demand-responsive transport systems. IEEE Trans. Intell. Transp. Syst. 16(2), 692–707 (2015)

    Google Scholar 

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

    Google Scholar 

  • Han, S., Yamaguchi, S.: Compensating wage differentials in stable job matching equilibrium. J. Econ. Behav. Organ. 114, 36–45 (2015)

    Google Scholar 

  • He, F., Yin, Y., Chen, Z., Zhou, J.: Pricing of parking games with atomic players. Transp. Res. Part B Methodol. 73, 1–12 (2015)

    Google Scholar 

  • Heilporn, G., Cordeau, J.F., Laporte, G.: An integer L-shaped algorithm for the dial-a-ride problem with stochastic customer delays. Discret. Appl. Math. 159(9), 883–895 (2011)

    Google Scholar 

  • Jiang, Y., Sheu, J., Peng, Z., Yu, B.: Hinterland patterns of China Railway (CR) express in China under the belt and road initiative: a preliminary analysis. Transp. Res. Part E Logist. Transp. Rev. 119, 189–201 (2018)

    Google Scholar 

  • Kamar, E., Horvitz, E., 2009. Collaboration and shared plans in the open world: studies of ridesharing. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 187–194

  • Kleiner, A., Nebel, B., Ziparo, V. A., 2011. A mechanism for dynamic ride sharing based on parallel auctions. In Proceedings of the 22th International Joint Conference on Artificial Intelligence (IJCAI), Barcelona, Spain, pp. 266–272

  • Koppelman, F.S., Bhat, C.R., Schofer, J.L.: Market research evaluation of actions to reduce suburban traffic congestion: commuter travel behavior and response to demand reduction actions. Transp. Res. Part A Policy Pract. 27(5), 383–393 (1993)

    Google Scholar 

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

    Google Scholar 

  • Li, B., Krushinsky, D., Reijers, H.A., Van Woensel, T.: The share-a-ride problem: people and parcels sharing taxis. Eur. J. Oper. Res. 238(1), 31–40 (2014)

    Google Scholar 

  • Li, D., Fu, B., Wang, Y., Lu, G., Berezin, Y., Stanley, H.E., Havlin, S.: Percolation transition in dynamical traffic network with evolving critical bottlenecks. Proc. Natl. Acad. Sci. 112(3), 669–672 (2015)

    Google Scholar 

  • Liu, Y., Li, Y.: Pricing scheme design of ridesharing program in morning commute problem. Trans. Res. Part C Emerg. Technol. 79, 156–177 (2017)

    Google Scholar 

  • Marković, N., Nair, R., Schonfeld, P., Miller-Hooks, E., Mohebbi, M.: Optimizing dial-a-ride services in Maryland: benefits of computerized routing and scheduling. Trans. Res. Part C Emerg. Technol. 55, 156–165 (2015)

    Google Scholar 

  • Ma, S., Zheng, Y., Wolfson, O.: Real-time city-scale taxi ridesharing. IEEE Trans. Knowl. Data Eng. 27(7), 1782–1795 (2015)

    Google Scholar 

  • McVitie, D.G., Wilson, L.B.: The stable marriage problem. Commun. ACM 14(7), 486–490 (1971)

    Google Scholar 

  • Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6), 1129–1138 (2010)

    Google Scholar 

  • Peng, Z., Shan, W., Guan, F., Yu, B.: Stable vessel-cargo matching in dry bulk shipping market with price game mechanism. Trans. Res. Part E Logist. Trans. Rev. 95, 76–94 (2016)

    Google Scholar 

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

    Google Scholar 

  • Rasulkhani, S., Chow, J. Y., 2017. Route-cost-assignment with joint user and operator behavior as a many-to-one stable matching assignment game. arXiv preprint arXiv:1711.11230

  • Roth, A.E., Rothblum, U.G., Vande Vate, J.H.: Stable matchings, optimal assignments, and linear programming. Math. Oper. Res. 18(4), 803–828 (1993)

    Google Scholar 

  • Roth, A.E., Vate, J.H.V.: Random paths to stability in two-sided matching. Econ. J. Econ. Soc. 58(6), 1475–1480 (1990)

    Google Scholar 

  • Roth, A.E., Vate, J.H.V.: Incentives in two-sided matching with random stable mechanisms. Econ. Theory 1(1), 31–44 (1991)

    Google Scholar 

  • Santos, A., McGuckin, N., Nakamoto, H. Y., Gray, D., Liss, S., 2011. Summary of travel trends: 2009 National household travel survey (No. FHWA-PL-ll-022)

  • Santos, D.O., Xavier, E.C.: Taxi and ride sharing: a dynamic dial-a-ride problem with money as an incentive. Expert Syst. Appl. 42(19), 6728–6737 (2015)

    Google Scholar 

  • Sayarshad, H.R., Chow, J.Y.: A scalable non-myopic dynamic dial-a-ride and pricing problem. Transp. Res. Part B Methodol. 81, 539–554 (2015)

    Google Scholar 

  • Sayarshad, H.R., Gao, H.O.: A scalable non-myopic dynamic dial-a-ride and pricing problem for competitive on-demand mobility systems. Transp. Res. Part C Emerg. Technol. 91, 192–208 (2018)

    Google Scholar 

  • Shao, H., Lam, W.H., Tam, M.L.: A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand. Netw. Spat. Econ. 6(3–4), 173–204 (2006)

    Google Scholar 

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

    Google Scholar 

  • Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: Making dynamic ride-sharing work: the impact of driver and rider flexibility. Transp. Res. Part E Logist. Trans. Rev. 91, 190–207 (2016)

    Google Scholar 

  • Tang, T., Shi, Y., Wang, Y., Yu, G.: A bus-following model with an on-line bus station. Nonlinear Dyn. 70(1), 209–215 (2012)

    Google Scholar 

  • Teodorović, D., Dell’Orco, M.: Mitigating traffic congestion: solving the ride-matching problem by bee colony optimization. Transp. Plan. Technol. 31(2), 135–152 (2008)

    Google Scholar 

  • Vate, J.H.V.: Linear programming brings marital bliss. Oper. Res. Lett. 8(3), 147–153 (1989)

    Google Scholar 

  • Wang, X., Agatz, N., Erera, A.: Stable matching for dynamic ride-sharing systems. Transp. Sci. (2017). https://doi.org/10.1287/trsc.2017.0768. (in press)

    Article  Google Scholar 

  • Xiang, Z., Chu, C., Chen, H.: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur. J. Oper. Res. 174(2), 1117–1139 (2006)

    Google Scholar 

  • Xiao, L.L., Liu, T.L., Huang, H.J.: On the morning commute problem with carpooling behavior under parking space constraint. Transp. Res. Part B Methodol. 91, 383–407 (2016)

    Google Scholar 

  • Yao, B.Z., Chen, C., Zhang, L., Yu, B., Wang, Y.P.: Allocation method for transit lines considering the user equilibrium for operators. Transp. Res. Part C Emerg. Technol. (2018). https://doi.org/10.1016/j.trc.2018.09.019. (in press)

    Article  Google Scholar 

  • Yao, B.Z., Yu, B., Hu, P., Gao, J.J., Zhang, M.H.: An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Ann. Oper. Res. 242(2), 303–320 (2016)

    Google Scholar 

  • Yu, B., Kong, L., Sun, Y., Yao, B., Gao, Z.: A bi-level programming for bus lane network design. Transp. Res. Part C Emerg. Technol. 55, 310–327 (2015)

    Google Scholar 

  • Yu, B., Song, X., Guan, F., Yang, Z., Yao, B.: k-Nearest neighbor model for multiple-time-step prediction of short-term traffic condition. J. Transp. Eng. 142(6), 04016018 (2016)

    Google Scholar 

  • Yu, B., Wang, H., Shan, W., Yao, B.: Prediction of bus travel time using random forests based on near neighbors. Computer-Aided Civil Infrastruct. Eng. 33(4), 333–350 (2018)

    Google Scholar 

  • Zhang, L., Wang, Y. P., Sun, J., Yu, B., 2016. The sightseeing bus schedule optimization under park and ride system in tourist attractions. Ann. Oper. Res. [in press: Online] https://doi.org/10.1007/s10479-016-2364-4 [Accessed:7th November 2016]

Download references

Acknowledgements

This research was supported in National Natural Science Foundation of China (51578112, 71571026), Higher Education Development Fund (for Collaborative Innovation Center) of Liaoning Province, China (Grant Nos. 20110116401, 20110116101), the Program for Innovative Research Team in University (IRT17R13), the Fundamental Research Funds for the Central Universities (3132018301, 3132018304), Liaoning Excellent Talents in University LR2015008, the Fundamental Research Funds for the Central Universities (YWF-16-BJ-J-40 and DUT16YQ104) and partially funded by Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang Universtity.

Author information

Authors and Affiliations

  1. Collaborative Innovation Center for Transport Studies, Dalian Maritime University, Dalian, 116026, China

    Zixuan Peng & Peng Jia

  2. Transportation Management College, Dalian Maritime University, Dalian, 116026, People’s Republic of China

    Zixuan Peng, Peng Jia & Bin Yu

  3. School of Transportation Science and Engineering, Beihang University, Beijing, 100191, People’s Republic of China

    Wenxuan Shan

  4. BDBC, Beihang University, Beijing, 100191, People’s Republic of China

    Bin Yu

  5. Urban Planning Group, Eindhoven University of Technology, PO Box 513, Vertigo 8.16, 5600MB, Eindhoven, The Netherlands

    Yonglei Jiang & Baozhen Yao

Authors
  1. Zixuan Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenxuan Shan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yonglei Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Baozhen Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Bin Yu or Baozhen Yao.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Peng, Z., Shan, W., Jia, P. et al. Stable ride-sharing matching for the commuters with payment design. Transportation 47, 1–21 (2020). https://doi.org/10.1007/s11116-018-9960-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11116-018-9960-x

Keywords

Search

Navigation