TRB Pubsindex
Text Size:
x

« Prev Next »

Return to Results | New Search

Bookmark and Share

Title:

Trip-Based Graph Partitioning in Peer-to-Peer Ridesharing

Accession Number:

01660465

Record Type:

Component

Abstract:

Ridesharing systems connect drivers who use their personal vehicles to travel with riders who are in need of transportation. Since each driver/rider may have several potential matches, to achieve a high performance level the ridesharing operator needs to make the matching decision based on a global view of the system that includes all active riders and drivers when proposing ride-matches. Consequently, the ride-matching problem that needs to be solved can become computationally expensive, especially when the system is operating over a large region, or when it faces high demand levels during certain hours of the day. This paper proposes a methodology to decompose the matching problem into multiple sub-problems with the goal of reducing the overall computational complexity of the problem as well as providing a high quality solution.

Supplemental Notes:

This paper was sponsored by TRB committee AP020 Standing Committee on Emerging and Innovative Public Transport and Technologies.

Report/Paper Numbers:

18-06119

Language:

English

Authors:

Masoud, Neda
Tu, Yuexi

Pagination:

4p

Publication Date:

2018

Conference:

Transportation Research Board 97th Annual Meeting

Location: Washington DC, United States
Date: 2018-1-7 to 2018-1-11
Sponsors: Transportation Research Board

Media Type:

Digital/other

Features:

Figures

Uncontrolled Terms:

Ride matching

Subject Areas:

Passenger Transportation; Planning and Forecasting; Public Transportation

Source Data:

Transportation Research Board Annual Meeting 2018 Paper #18-06119

Files:

TRIS, TRB, ATRI

Created Date:

Jan 8 2018 11:35AM