Skip to main content
Article thumbnail
Location of Repository

ABSTRACT

By Brian Coltin

Abstract

Ridesharing services have the potential to fill empty seats in cars, reduce emissions and enable more efficient transportation. We propose rideshare services which transfer passengers between multiple drivers. By planning for transfers, we increase the availability and range of the rideshare service, and reduce the total vehicular miles travelled by the network. We propose three heuristics to schedule rideshare routes with transfers. Each provides a tradeoff in effectiveness and computational cost. We demonstrate these tradeoffs and the advantage of transfers in simulation

Topics: transfers, auctions
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6459
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cmu.edu/~mmv/pap... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.