IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v145y2021icp212-246.html
   My bibliography  Save this article

Can dynamic ride-sharing reduce traffic congestion?

Author

Listed:
  • Alisoltani, Negin
  • Leclercq, Ludovic
  • Zargayouna, Mahdi

Abstract

Can dynamic ride-sharing reduce traffic congestion? In this paper we show that the answer is yes if the trip density is high, which is usually the case in large-scale networks but not in medium-scale networks where opportunities for sharing in time and space become rather limited. When the demand density is high, the dynamic ride-sharing system can significantly improve traffic conditions, especially during peak hours. Sharing can compensate extra travel distances related to operating a mobility service. The situation is entirely different in small and medium-scale cities when trip shareability is small, even if the ride-sharing system is fully optimized based on the perfect demand prediction in the near future. The reason is simple, mobility services significantly increase the total travel distance, and sharing is simply a means of combating this trend without eliminating it when the trip density is not high enough. This paper proposes a complete framework to represent the functioning of the ride-sharing system and multiple steps to tackle the curse of dimensionality when solving the problem. We address the problem for two city scales in order to compare different trip densities. A city scale of 25 km2 with a total market of 11,235 shareable trips for the medium-scale network and a city scale of 80 km2 with 205,308 demand for service vehicles for the large-scale network over a 4-hour period with a rolling horizon of 20 minutes. The solutions are assessed using a dynamic trip-based macroscopic simulation to account for the congestion effect and dynamic travel times that may influence the optimal solution obtained with predicted travel times. This outperforms most previous studies on optimal fleet management that usually consider constant and fully deterministic travel time functions.

Suggested Citation

  • Alisoltani, Negin & Leclercq, Ludovic & Zargayouna, Mahdi, 2021. "Can dynamic ride-sharing reduce traffic congestion?," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 212-246.
    • Handle: RePEc:eee:transb:v:145:y:2021:i:c:p:212-246
    DOI: 10.1016/j.trb.2021.01.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521000114
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2021.01.004?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.

    Citations

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


    Cited by:

    1. Qizhao Peng & Weiwei Wang & Xiaoyan Yang & Yi Wang & Jian Chen, 2023. "Research on Affective Interaction in Mini Public Transport Based on IPA-FMEA," Sustainability, MDPI, vol. 15(9), pages 1-21, April.
    2. Yining Liu & Yanfeng Ouyang, 2022. "Planning ride-pooling services with detour restrictions for spatially heterogeneous demand: A multi-zone queuing network approach," Papers 2208.02219, arXiv.org, revised Jun 2023.
    3. Mayara Moraes Monteiro & Carlos M. Lima Azevedo & Maria Kamargianni & Yoram Shiftan & Ayelet Gal-Tzur & Sharon Shoshany Tavory & Constantinos Antoniou & Guido Cantelmo, 2022. "Car-Sharing Subscription Preferences: The Case of Copenhagen, Munich, and Tel Aviv-Yafo," Papers 2206.02448, arXiv.org.
    4. Liu, Yining & Ouyang, Yanfeng, 2023. "Planning ride-pooling services with detour restrictions for spatially heterogeneous demand: A multi-zone queuing network approach," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    5. Hao, Wu & Martin, Layla, 2022. "Prohibiting cherry-picking: Regulating vehicle sharing services who determine fleet and service structure," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    6. Zhang, Wenqing & Liu, Liangliang, 2022. "Exploring non-users' intention to adopt ride-sharing services: Taking into account increased risks due to the COVID-19 pandemic among other factors," Transportation Research Part A: Policy and Practice, Elsevier, vol. 158(C), pages 180-195.
    7. Wang, Dujuan & Wang, Qi & Yin, Yunqiang & Cheng, T.C.E., 2023. "Optimization of ride-sharing with passenger transfer via deep reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    8. Mohandu Anjaneyulu & Mohan Kubendiran, 2022. "Short-Term Traffic Congestion Prediction Using Hybrid Deep Learning Technique," Sustainability, MDPI, vol. 15(1), pages 1-18, December.
    9. André de Palma & Lucas Javaudin & Patrick Stokkink & Léandre Tarpin-Pitre, 2022. "Ride-sharing with inflexible drivers in the Paris metropolitan area," Post-Print hal-03880692, HAL.
    10. Künnen, Jan-Rasmus & Strauss, Arne K., 2022. "The value of flexible flight-to-route assignments in pre-tactical air traffic management," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 76-96.
    11. Seyed Omid Hasanpour Jesri & Mohsen Akbarpour Shirazi, 2022. "Bi Objective Peer-to-Peer Ridesharing Model for Balancing Passengers Time and Costs," Sustainability, MDPI, vol. 14(12), pages 1-24, June.

    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:transb:v:145:y:2021:i:c:p:212-246. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/548/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.