TRB Pubsindex
Text Size:
x

« Prev Next »

Return to Results | New Search

Bookmark and Share

Title:

A decomposition Algorithm to solve the multi-hop peer-to-peer ride-matching problem

Accession Number:

01553110

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States

Abstract:

In this paper, the authors present a formulation of the multi-hop many-to-many Peer-to-Peer ride- matching problem, found in shared-ride applications. A many-to-many problem is one in which a rider can travel with multiple drivers, and a driver can carry multiple riders. The authors propose a pre- processing procedure to reduce the size of the problem. Furthermore, they devise a decomposition algorithm to solve the original ride-matching problem to optimality by means of solving multiple smaller problems. Finally, they demonstrate the computational efficiency of the proposed algorithm by solving randomly generated instances of the problem.

Supplemental Notes:

This paper was sponsored by TRB committee AP020 Emerging and Innovative Public Transport and Technologies. Alternate title: Decomposition Algorithm to Solve Multihop Peer-to-Peer Ride-Matching Problem.

Monograph Accession #:

01550057

Report/Paper Numbers:

15-2755

Language:

English

Corporate Authors:

Transportation Research Board

500 Fifth Street, NW
Washington, DC 20001 United States

Authors:

Masoud, Neda
Jayakrishnan, R

Pagination:

18p

Publication Date:

2015

Conference:

Transportation Research Board 94th Annual Meeting

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

Media Type:

Digital/other

Features:

Figures; References; Tables

Subject Areas:

Planning and Forecasting; Public Transportation; I72: Traffic and Transport Planning

Source Data:

Transportation Research Board Annual Meeting 2015 Paper #15-2755

Files:

TRIS, TRB, ATRI

Created Date:

Dec 30 2014 12:57PM