How Many Passengers Can We Serve with Ride-sharing?

01/22/2019
by   Zeren Tan, et al.
0

Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors. Existing literature did not consider ride-sharing with multi-request grouped in one trip. In our paper, we firstly proposed a graph-based algorithm that can obtain an approximation solution in polynomial time and then proposed an exact algorithm to solve this problem with maximizing the number of passenegers served in O(1.2312^|E|) time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2020

GMACO-P: GPU assisted Preemptive MACO algorithm for enabling Smart Transportation

Vehicular Ad-hoc NETworks (VANETs) are developing at a very fast pace to...
research
01/30/2022

Sharing Behavior in Ride-hailing Trips: A Machine Learning Inference Approach

Ride-hailing is rapidly changing urban and personal transportation. Ride...
research
12/19/2017

The Merits of Sharing a Ride

The culture of sharing instead of ownership is sharply increasing in ind...
research
12/24/2018

Graph-Based Algorithm for a User-Aware SaaS Approach: Computing Optimal Distribution

As a tool to exploit economies of scale, Software as a Service cloud mod...
research
01/21/2021

Graph-based many-to-one dynamic ride-matching for shared mobility services in congested networks

On-demand shared mobility systems require matching of one (one-to-one) o...
research
05/04/2022

Constrained Backward Time Travel Planning is in P

We consider transportation networks that are modeled by dynamic graphs, ...
research
07/06/2020

Approximation algorithms for car-sharing problems

We consider several variants of a car-sharing problem. Given are a numbe...

Please sign up or login with your details

Forgot password? Click here to reset