IDEAS home Printed from https://ideas.repec.org/p/cdl/itsdav/qt90g88330.html
   My bibliography  Save this paper

Flexible Routing for Ridesharing

Author

Listed:
  • Dessouky, Maged
  • Mahtab, Zuhayer

Abstract

Traffic congestion is a significant problem in major metropolitan areas in the United States. According to the Urban Mobility Report, in 2019 commuters on average lost about 54 hours in traffic congestion. To combat this, major infrastructure projects have been undertaken. However, expansion projects cannot keep up with the increase in usage of personal vehicles and thus fail to address the traffic congestion problem. Carpool ridesharing has shown some promise in combatting this traffic congestion problem. In this system, the drivers are regular commuters who take detours to pick up and drop off passengers to decrease their transportation costs. This system increases the efficiency of the transportation system by providing flexible commutes to people, thus reducing the need for each commuter to use their own personal vehicle. The researchers developed three approaches to rideshare routing. The researchers conducted a computational study using a San Francisco taxicab dataset to determine the effectiveness of the three approaches. To show the impact of flexible meeting points, the researchers also conducted experimental simulations with and without walking and performed sensitivity analyses. View the NCST Project Webpage

Suggested Citation

  • Dessouky, Maged & Mahtab, Zuhayer, 2023. "Flexible Routing for Ridesharing," Institute of Transportation Studies, Working Paper Series qt90g88330, Institute of Transportation Studies, UC Davis.
  • Handle: RePEc:cdl:itsdav:qt90g88330
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/90g88330.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Engineering; Dynamic programming; Mixed integer programming; Origin and destination; Ridesharing; Routing; Travel time; Waiting time;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cdl:itsdav:qt90g88330. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucdus.html .

    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.