IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-03880692.html

Ride-sharing with inflexible drivers in the Paris metropolitan area

Author

Listed:
  • André de Palma

    (THEMA - Théorie économique, modélisation et applications - CNRS - Centre National de la Recherche Scientifique - CY - CY Cergy Paris Université)

  • Lucas Javaudin

    (THEMA - Théorie économique, modélisation et applications - CNRS - Centre National de la Recherche Scientifique - CY - CY Cergy Paris Université)

  • Patrick Stokkink

    (Urban Transport Systems Laboratory - EPFL - Ecole Polytechnique Fédérale de Lausanne)

  • Léandre Tarpin-Pitre

    (Urban Transport Systems Laboratory - EPFL - Ecole Polytechnique Fédérale de Lausanne)

Abstract

In ride-sharing, commuters with similar itineraries share a vehicle for their trip. Despite its clear benefits in terms of reduced congestion, ridesharing is not yet widely accepted. We propose a specific ride-sharing variant, where drivers are completely inflexible. This variant can form a competitive alternative against private transportation, due to the limited efforts that need to be made by drivers. However, due to this inflexibility, matching of drivers and riders can be substantially more complicated, compared to the situation where drivers can deviate. In this work, we propose a four-step procedure to identify the effect of such a ride-sharing scheme. We use a dynamic mesoscopic traffic simulator which computes departure-time choices and route choices for each commuter. The optimal matching of potential drivers and riders is obtained outside the simulation framework through an exact formulation of the problem. We evaluate the potential of this ridesharing scheme on a real network of the Paris metropolitan area for the morning commute. We show that even with inflexible drivers and when only a small share of the population is willing to participate in the ride-sharing scheme, ride-sharing can alleviate congestion. Further improvements can be obtained by increasing the capacity of the vehicles or by providing small monetary incentives, but without jeopardizing the inflexibility of the drivers. Thereby, we show that ridesharing can lead to fuel savings, CO2 emission reductions and travel time savings on a network level, even with a low participation rate.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • 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.
  • Handle: RePEc:hal:journl:hal-03880692
    DOI: 10.1007/s11116-022-10361-1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

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


    Cited by:

    1. Cheng, Xusen & Zhang, Shuang & Ran, Yanyue & Ma, Baojun, 2024. "Enhancing the perceived resilience of the road transportation system: Utilizing cues from ridesharing," Transportation Research Part A: Policy and Practice, Elsevier, vol. 186(C).
    2. P.Delle Site & André de Palma & Samarth Ghoslya, 2024. "Matching and fair pricing of socially optimal, stable and financially sustainable ride-sharing in congestible networks," Thema Working Papers 2024-06, THEMA (Théorie Economique, Modélisation et Applications), CY Cergy-Paris University, ESSEC and CNRS.
    3. André de Palma & Zhenyu Yang & Pietro Giardina & Nikolas Gerolimnis, 2025. "Recovering Scheduling Preferences in Dynamic Departure Time Models," Thema Working Papers 2025-15, THEMA (Théorie Economique, Modélisation et Applications), CY Cergy-Paris University, ESSEC and CNRS.
    4. Lucas javaudin & André de Palma, 2024. "METROPOLIS2: Bridging Theory and Simulation in Agent-Based Transport Modeling," Thema Working Papers 2024-03, THEMA (Théorie Economique, Modélisation et Applications), CY Cergy-Paris University, ESSEC and CNRS.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • R41 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - Transportation: Demand, Supply, and Congestion; Travel Time; Safety and Accidents; Transportation Noise
    • R48 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - Transportation Economics - - - Government Pricing and Policy

    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:hal:journl:hal-03880692. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.