IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i21p6931-d661924.html
   My bibliography  Save this article

A Comparison of Three Ridesharing Cost Savings Allocation Schemes Based on the Number of Acceptable Shared Rides

Author

Listed:
  • Fu-Shiung Hsieh

    (Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413310, Taiwan)

Abstract

Shared mobility based on cars refers to a transportation mode in which travelers/drivers share vehicles to reduce the cost of the journey, emissions, air pollution and parking demands. Cost savings provide a strong incentive for the shared mobility mode. As cost savings are due to cooperation of the stakeholders in shared mobility systems, they should be properly divided and allocated to relevant participants. Improper allocation of cost savings will lead to dissatisfaction of drivers/passengers and hinder acceptance of the shared mobility mode. In practice, several schemes based on proportional methods to allocate cost savings have been proposed in shared mobility systems. However, there is neither a guideline for selecting these proportional methods nor a comparative study on effectiveness of these proportional methods. Although shared mobility has attracted much attention in the research community, there is still a lack of study of the influence of cost saving allocation schemes on performance of shared mobility systems. Motivated by deficiencies of existing studies, this paper aims to compare three proportional cost savings allocation schemes by analyzing their performance in terms of the numbers of acceptable rides under different schemes. We focus on ridesharing based on cars in this study. The main contribution is to develop theory based on our analysis to characterize the performance under different schemes to provide a guideline for selecting these proportional methods. The theory developed is verified by conducting experiments based on real geographical data.

Suggested Citation

  • Fu-Shiung Hsieh, 2021. "A Comparison of Three Ridesharing Cost Savings Allocation Schemes Based on the Number of Acceptable Shared Rides," Energies, MDPI, vol. 14(21), pages 1-30, October.
    • Handle: RePEc:gam:jeners:v:14:y:2021:i:21:p:6931-:d:661924
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/21/6931/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/14/21/6931/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    2. Renaud Masson & Anna Trentini & Fabien Lehuédé & Nicolas Malhéné & Olivier Péton & Houda Tlahig, 2017. "Optimization of a city logistics transportation system with mixed passengers and goods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 81-109, March.
    3. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    4. Kalai, Ehud, 1977. "Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons," Econometrica, Econometric Society, vol. 45(7), pages 1623-1630, October.
    5. Klarin, Anton & Suseno, Yuliani, 2021. "A state-of-the-art review of the sharing economy: Scientometric mapping of the scholarship," Journal of Business Research, Elsevier, vol. 126(C), pages 250-262.
    6. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. Hyland, Michael & Mahmassani, Hani S., 2020. "Operational benefits and challenges of shared-ride automated mobility-on-demand services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 251-270.
    8. Agatz, Niels A.H. & Erera, Alan L. & Savelsbergh, Martin W.P. & Wang, Xing, 2011. "Dynamic ride-sharing: A simulation study in metro Atlanta," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1450-1464.
    9. Shaheen, Susan PhD & Chan, Nelson, 2016. "Mobility and the Sharing Economy: Potential to Overcome First- and Last-Mile Public Transit Connections," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt8042k3d7, Institute of Transportation Studies, UC Berkeley.
    10. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    11. Flisberg, Patrik & Frisk, Mikael & Rönnqvist, Mikael & Guajardo, Mario, 2015. "Potential savings and cost allocations for forest fuel transportation in Sweden: A country-wide study," Energy, Elsevier, vol. 85(C), pages 353-365.
    12. Roberto Baldacci & Vittorio Maniezzo & Aristide Mingozzi, 2004. "An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation," Operations Research, INFORMS, vol. 52(3), pages 422-439, June.
    13. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    14. Shaheen, Susan PhD & Chan, Nelson & Gaynor, Theresa, 2016. "Casual Carpooling in the San Francisco Bay Area: Understanding User Characteristics, Behaviors, and Motivations," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt4dh2h0rf, Institute of Transportation Studies, UC Berkeley.
    15. Lu, Wei & Quadrifoglio, Luca, 2019. "Fair cost allocation for ridesharing services – modeling, mathematical programming and an algorithm to find the nucleolus," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 41-55.
    16. Berger, Susanne & Bierwirth, Christian, 2010. "Solutions to the request reassignment problem in collaborative carrier networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 627-638, September.
    17. Shaheen, Susan A. & Chan, Nelson D. & Gaynor, Teresa, 2016. "Casual carpooling in the San Francisco Bay Area: Understanding user characteristics, behaviors, and motivations," Transport Policy, Elsevier, vol. 51(C), pages 165-173.
    18. Li, Baoxiang & Krushinsky, Dmitry & Reijers, Hajo A. & Van Woensel, Tom, 2014. "The Share-a-Ride Problem: People and parcels sharing taxis," European Journal of Operational Research, Elsevier, vol. 238(1), pages 31-40.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Csercsik, Dávid, 2022. "Convex combinatorial auction of pipeline network capacities," Energy Economics, Elsevier, vol. 111(C).
    2. Das, Subasish & Tawhidur Rahman, Md & Kabir, Nuzhat & Oviedo-Trespalacios, Oscar & Dey, Kakan & Mahmud Hossain, Md, 2023. "Do people act differently while using ridesharing services with children?," Transportation Research Part A: Policy and Practice, Elsevier, vol. 171(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    2. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    3. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2022. "Environmental and social implications of incorporating carpooling service on a customized bus system," Post-Print hal-03598768, HAL.
    4. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
    5. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    6. Yi, Xu & Lian, Feng & Yang, Zhongzhen, 2022. "Research on commuters’ carpooling behavior in the mobile internet context," Transport Policy, Elsevier, vol. 126(C), pages 14-25.
    7. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    8. Omer Faruk Aydin & Ilgin Gokasar & Onur Kalan, 2020. "Matching algorithm for improving ride-sharing by incorporating route splits and social factors," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-23, March.
    9. Wang, Jing-Peng & Ban, Xuegang (Jeff) & Huang, Hai-Jun, 2019. "Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 390-415.
    10. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    11. Enzi, Miriam & Parragh, Sophie N. & Pisinger, David & Prandtstetter, Matthias, 2021. "Modeling and solving the multimodal car- and ride-sharing problem," European Journal of Operational Research, Elsevier, vol. 293(1), pages 290-303.
    12. Ke, Jintao & Yang, Hai & Zheng, Zhengfei, 2020. "On ride-pooling and traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 213-231.
    13. Naoum-Sawaya, Joe & Cogill, Randy & Ghaddar, Bissan & Sajja, Shravan & Shorten, Robert & Taheri, Nicole & Tommasi, Pierpaolo & Verago, Rudi & Wirth, Fabian, 2015. "Stochastic optimization approach for the car placement problem in ridesharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 173-184.
    14. Arslan, A.M. & Agatz, N.A.H. & Kroon, L.G. & Zuidwijk, R.A., 2016. "Crowdsourced Delivery: A Dynamic Pickup and Delivery Problem with Ad-hoc Drivers," ERIM Report Series Research in Management ERS-2016-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. Long, Jiancheng & Tan, Weimin & Szeto, W.Y. & Li, Yao, 2018. "Ride-sharing with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 143-171.
    16. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    17. Boysen, Nils & Emde, Simon & Schwerdfeger, Stefan, 2022. "Crowdshipping by employees of distribution centers: Optimization approaches for matching supply and demand," European Journal of Operational Research, Elsevier, vol. 296(2), pages 539-556.
    18. Zixuan Peng & Wenxuan Shan & Peng Jia & Bin Yu & Yonglei Jiang & Baozhen Yao, 2020. "Stable ride-sharing matching for the commuters with payment design," Transportation, Springer, vol. 47(1), pages 1-21, February.
    19. Fielbaum, Andres & Kucharski, Rafał & Cats, Oded & Alonso-Mora, Javier, 2022. "How to split the costs and charge the travellers sharing a ride? aligning system’s optimum with users’ equilibrium," European Journal of Operational Research, Elsevier, vol. 301(3), pages 956-973.
    20. Zhang, Haoran & Chen, Jinyu & Li, Wenjing & Song, Xuan & Shibasaki, Ryosuke, 2020. "Mobile phone GPS data in urban ride-sharing: An assessment method for emission reduction potential," Applied Energy, Elsevier, vol. 269(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:14:y:2021:i:21:p:6931-:d:661924. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.