The Merits of Sharing a Ride

12/19/2017
by   Pooyan Ehsani, et al.
0

The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization approach to match passengers in real-time is the core of any ridesharing system. In this paper, we model ridesharing as an online matching problem on general graphs such that passengers do not drive private cars and use shared taxis. We propose an optimization algorithm to solve it. The outlined algorithm calculates the optimal waiting time when a passenger arrives. This leads to a matching with minimal overall overheads while maximizing the number of partnerships. To evaluate the behavior of our algorithm, we used NYC taxi real-life data set. Results represent a substantial reduction in overall overheads.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2019

How Many Passengers Can We Serve with Ride-sharing?

Ride-sharing can reduce traffic congestion and thus reduce gas emissions...
research
09/07/2020

Efficient Quantification of Profile Matching Risk in Social Networks

Anonymous data sharing has been becoming more challenging in today's int...
research
07/15/2020

An algorithm for integrating peer-to-peer ridesharing and schedule-based transit system for first mile/last mile access

Due to limited transit network coverage and infrequent service, suburban...
research
04/03/2016

Bicycle-Sharing System Analysis and Trip Prediction

Bicycle-sharing systems, which can provide shared bike usage services fo...
research
05/27/2021

A Dynamic Tree Algorithm for Peer-to-Peer Ride-sharing Matching

On-demand peer-to-peer ride-sharing services provide flexible mobility o...
research
07/17/2023

Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem

We consider the online transportation problem set in a metric space cont...
research
08/17/2016

Multi-Person Tracking by Multicut and Deep Matching

In [1], we proposed a graph-based formulation that links and clusters pe...

Please sign up or login with your details

Forgot password? Click here to reset