Author
Listed:
- Amirmahdi Tafreshian
(Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109)
- Neda Masoud
(Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109)
Abstract
Traffic congestion has become a serious issue around the globe, partly owing to single-occupancy commuter trips. Ridesharing can present a suitable alternative for serving commuter trips. However, there are several important obstacles that impede ridesharing systems from becoming a viable mode of transportation, including the lack of a guarantee for a ride back home as well as the difficulty of obtaining a critical mass of participants. This paper addresses these obstacles by introducing a traveler incentive program (TIP) to promote community-based ridesharing with a ride back home guarantee among commuters. The TIP program allocates incentives to (1) directly subsidize a select set of ridesharing rides and (2) encourage a small, carefully selected set of travelers to change their travel behavior (i.e., departure or arrival times). We formulate the underlying ride-matching problem as a budget-constrained min-cost flow problem and present a Lagrangian relaxation-based algorithm with a worst-case optimality bound to solve large-scale instances of this problem in polynomial time. We further propose a polynomial-time, budget-balanced version of the problem. Numerical experiments suggest that allocating subsidies to change travel behavior is significantly more beneficial than directly subsidizing rides. Furthermore, using a flat tax rate as low as 1% can double the system’s social welfare in the budget-balanced variant of the incentive program.
Suggested Citation
Amirmahdi Tafreshian & Neda Masoud, 2022.
"A Traveler Incentive Program for Promoting Community-Based Ridesharing,"
Transportation Science, INFORMS, vol. 56(4), pages 827-847, July.
Handle:
RePEc:inm:ortrsc:v:56:y:2022:i:4:p:827-847
DOI: 10.1287/trsc.2021.1121
Download full text from publisher
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:inm:ortrsc:v:56:y:2022:i:4:p:827-847. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.