IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v142y2020ics1366554520307043.html
   My bibliography  Save this article

Nonprofit peer-to-peer ridesharing optimization

Author

Listed:
  • Sun, Yanshuo
  • Chen, Zhi-Long
  • Zhang, Lei

Abstract

Both for-profit and nonprofit peer-to-peer (P2P) ridesharing services have gained enormous popularity in recent years due to their advantages over solo driving and public transit. We study the rideshare matching and routing problem in a nonprofit P2P ridesharing system consisting of a matching agency, drivers and riders. The matching agency is a government or a not-for-profit organization and its objective is to maximize the societal benefits of ridesharing. The drivers involved are commuters and hence have their own travel plans, which are executed regardless of whether riders are matched with them. We consider both static and dynamic versions of the nonprofit P2P ridesharing problem. Existing modeling and solution approaches for similar P2P ridesharing problems can only solve relatively small problem instances optimally. We propose an exact solution algorithm for the static version of the problem by taking advantage of its special characteristics. This exact solution approach formulates and solves the problem as a set packing formulation using route-based variables, and uses an efficient graph-based approach to generate all necessary vehicle routes in the formulation quickly. We also develop a column generation (CG) based heuristic approach for the static problem. Finally, we propose two dynamic dispatching policies for the dynamic version of the problem. Our proposed exact algorithm solves very large problem instances (e.g., with 600 drivers and 1800 riders) of the static problem and our CG based heuristic can find near-optimal solutions for even larger instances of the static problem in short computation time. Our dynamic dispatching policies can generate near-optimal solutions for the dynamic problem in real-time fashion. We also generate some important insights based on some taxi trip data in Washington DC. First, P2P ridesharing can bring significant cost-saving, especially when the participants have a relatively flexible schedule. For every 10% increase in schedule flexibility, there is an about 4% to 7% increase in cost-saving. Second, the cost-saving due to ridesharing increases with the vehicle capacity, but this increase slows down quickly when the vehicle capacity reaches 4. Third, ridesharing generates more cost savings during peak hours and in urban areas.

Suggested Citation

  • 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).
  • Handle: RePEc:eee:transe:v:142:y:2020:i:c:s1366554520307043
    DOI: 10.1016/j.tre.2020.102053
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554520307043
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2020.102053?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Rayle, Lisa & Dai, Danielle & Chan, Nelson & Cervero, Robert & Shaheen, Susan, 2016. "Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco," Transport Policy, Elsevier, vol. 45(C), pages 168-178.
    3. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    4. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    5. 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.
    6. Martin Desrochers & Jacques Desrosiers & Marius Solomon, 1992. "A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 40(2), pages 342-354, April.
    7. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi, 2011. "An Exact Algorithm for the Pickup and Delivery Problem with Time Windows," Operations Research, INFORMS, vol. 59(2), pages 414-426, April.
    8. 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.
    9. 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.
    10. Zhi-Long Chen & Warren B. Powell, 1999. "Solving Parallel Machine Scheduling Problems by Column Generation," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 78-94, February.
    11. 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.
    12. Veaceslav Ghilas & Jean-François Cordeau & Emrah Demir & Tom Van Woensel, 2018. "Branch-and-Price for the Pickup and Delivery Problem with Time Windows and Scheduled Lines," Transportation Science, INFORMS, vol. 52(5), pages 1191-1210, October.
    13. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    14. 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.
    15. 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.
    16. Gerardo Berbeglia & Jean-François Cordeau & Gilbert Laporte, 2012. "A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 343-355, August.
    17. Ma, Tai-Yu & Rasulkhani, Saeid & Chow, Joseph Y.J. & Klein, Sylvain, 2019. "A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 128(C), pages 417-442.
    18. 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.
    19. Cherkesly, Marilène & Desaulniers, Guy & Irnich, Stefan & Laporte, Gilbert, 2016. "Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks," European Journal of Operational Research, Elsevier, vol. 250(3), pages 782-793.
    20. Stefan Ropke & Jean-François Cordeau, 2009. "Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 43(3), pages 267-286, August.
    21. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    22. Rayle, Lisa & Dai, Danielle & Chan, Nelson & Cervero, Robert & Shaheen, Susan PhD, 2016. "Just A Better Taxi? A Survey-Based Comparison of Taxis, Transit, and Ridesourcing Services in San Francisco," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt60v8r346, Institute of Transportation Studies, UC Berkeley.
    23. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    24. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    25. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2016. "Making dynamic ride-sharing work: The impact of driver and rider flexibility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 190-207.
    26. 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.
    27. Martin Savelsbergh & Marc Sol, 1998. "Drive: Dynamic Routing of Independent Vehicles," Operations Research, INFORMS, vol. 46(4), pages 474-490, August.
    28. Bernhard Fleischmann & Stefan Gnutzmann & Elke Sandvoß, 2004. "Dynamic Vehicle Routing Based on Online Traffic Information," Transportation Science, INFORMS, vol. 38(4), pages 420-433, November.
    29. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    30. Robert Day & Robert Garfinkel & Steven Thompson, 2012. "Integrated Block Sharing: A Win-Win Strategy for Hospitals and Surgeons," Manufacturing & Service Operations Management, INFORMS, vol. 14(4), pages 567-583, October.
    31. 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.
    32. Renaud Masson & Fabien Lehuédé & Olivier Péton, 2013. "An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers," Transportation Science, INFORMS, vol. 47(3), pages 344-355, August.
    33. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    34. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    35. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, February.
    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. 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).

    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. 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).
    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. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    5. 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.
    6. 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.
    7. Wenyi Chen & Martijn Mes & Marco Schutten & Job Quint, 2019. "A Ride-Sharing Problem with Meeting Points and Return Restrictions," Transportation Science, INFORMS, vol. 53(2), pages 401-426, March.
    8. 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.
    9. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    10. 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.
    11. 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.
    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. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    15. Mahmoudi, Monirehalsadat & Chen, Junhua & Shi, Tie & Zhang, Yongxiang & Zhou, Xuesong, 2019. "A cumulative service state representation for the pickup and delivery problem with transfers," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 351-380.
    16. 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.
    17. 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.
    18. 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.
    19. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    20. Lei, Chao & Jiang, Zhoutong & Ouyang, Yanfeng, 2020. "Path-based dynamic pricing for vehicle allocation in ridesharing systems with fully compliant drivers," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 60-75.

    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:eee:transe:v:142:y:2020:i:c:s1366554520307043. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.