IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0229674.html
   My bibliography  Save this article

Matching algorithm for improving ride-sharing by incorporating route splits and social factors

Author

Listed:
  • Omer Faruk Aydin
  • Ilgin Gokasar
  • Onur Kalan

Abstract

Increasing traffic congestion and the advancements in technology have fostered the growth of alternative transportation modes such as dynamic ride-sharing. Smartphone technologies have enabled dynamic ride-sharing to thrive, as this type of transportation aims to establish ride matches between people with similar routes and schedules on short notice. Many automated matching methods are designed to improve system performance; such methods include minimizing process time, minimizing total system cost or maximizing total distance savings. However, the results may not provide the maximum benefits for the participants. This paper intends to develop an algorithm for optimizing matches when considering participants’ gender, age, employment status and social tendencies. The proposed matching algorithm also splits unmatched parts of drivers’ routes and creates new travel requests to find additional matches using these unmatched parts. Accordingly, this paper performs an extensive simulation study to assess the performance of the proposed algorithm. The simulation results indicate that route splits may increase the number of matches significantly when there is a shortage of drivers. Furthermore, the paper demonstrates the effects and potential benefits of utilizing a social compatibility score in the objective function.

Suggested Citation

  • 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.
    • Handle: RePEc:plo:pone00:0229674
    DOI: 10.1371/journal.pone.0229674
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0229674
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0229674&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0229674?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.
    3. 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.
    4. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2015. "The benefits of meeting points in ride-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 36-53.
    5. Edrissi, Ali & Poorzahedy, Hossain & Nassiri, Habibollah & Nourinejad, Mehdi, 2013. "A multi-agent optimization formulation of earthquake disaster prevention and management," European Journal of Operational Research, Elsevier, vol. 229(1), pages 261-275.
    6. Furuhata, Masabumi & Dessouky, Maged & Ordóñez, Fernando & Brunet, Marc-Etienne & Wang, Xiaoqing & Koenig, Sven, 2013. "Ridesharing: The state-of-the-art and future directions," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 28-46.
    7. 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.
    8. 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.
    9. Lee, Alan & Savelsbergh, Martin, 2015. "Dynamic ridesharing: Is there a role for dedicated drivers?," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 483-497.
    10. 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.
    11. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2015. "The Benefits of Meeting Points in Ride-sharing Systems," ERIM Report Series Research in Management ERS-2015-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.
    12. 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.
    13. Masoud, Neda & Jayakrishnan, R., 2017. "A real-time algorithm to solve the peer-to-peer ride-matching problem in a flexible ridesharing system," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 218-236.
    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. Sunghi An & Daisik Nam & R. Jayakrishnan & Soongbong Lee & Michael G. McNally, 2021. "A Study of the Factors Affecting Multimodal Ridesharing with Choice-Based Conjoint Analysis," Sustainability, MDPI, vol. 13(20), pages 1-14, October.

    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. 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.
    4. 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.
    5. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    6. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    7. 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.
    8. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    9. 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.
    10. 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).
    11. 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.
    12. Ruijie Li & Yu (Marco) Nie & Xiaobo Liu, 2020. "Pricing Carpool Rides Based on Schedule Displacement," Transportation Science, INFORMS, vol. 54(4), pages 1134-1152, July.
    13. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.
    14. Zhang, Ruolin & Masoud, Neda, 2021. "A distributed algorithm for operating large-scale ridesourcing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    15. 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.
    16. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2016. "Enhancing Urban Mobility: Integrating Ride-sharing and Public Transit," ERIM Report Series Research in Management ERS-2016-006-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.
    17. Tao Yang & Weixin Wang, 2022. "Logistics Network Distribution Optimization Based on Vehicle Sharing," Sustainability, MDPI, vol. 14(4), pages 1-12, February.
    18. 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.
    19. 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.
    20. Stumpe, Miriam & Dieter, Peter & Schryen, Guido & Müller, Oliver & Beverungen, Daniel, 2024. "Designing taxi ridesharing systems with shared pick-up and drop-off locations: Insights from a computational study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 183(C).

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0229674. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.