Competitive Ratios for Online Multi-capacity Ridesharing

09/16/2020
by   Meghna Lowalekar, et al.
1

In multi-capacity ridesharing, multiple requests (e.g., customers, food items, parcels) with different origin and destination pairs travel in one resource. In recent years, online multi-capacity ridesharing services (i.e., where assignments are made online) like Uber-pool, foodpanda, and on-demand shuttles have become hugely popular in transportation, food delivery, logistics and other domains. This is because multi-capacity ridesharing services benefit all parties involved the customers (due to lower costs), the drivers (due to higher revenues) and the matching platforms (due to higher revenues per vehicle/resource). Most importantly these services can also help reduce carbon emissions (due to fewer vehicles on roads). Online multi-capacity ridesharing is extremely challenging as the underlying matching graph is no longer bipartite (as in the unit-capacity case) but a tripartite graph with resources (e.g., taxis, cars), requests and request groups (combinations of requests that can travel together). The desired matching between resources and request groups is constrained by the edges between requests and request groups in this tripartite graph (i.e., a request can be part of at most one request group in the final assignment). While there have been myopic heuristic approaches employed for solving the online multi-capacity ridesharing problem, they do not provide any guarantees on the solution quality. To that end, this paper presents the first approach with bounds on the competitive ratio for online multi-capacity ridesharing (when resources rejoin the system at their initial location/depot after serving a group of requests).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2021

Online Food Delivery to Minimize Maximum Flow Time

We study a common delivery problem encountered in nowadays online food-o...
research
09/13/2020

Zone pAth Construction (ZAC) based Approaches for Effective Real-Time Ridesharing

Real-time ridesharing systems such as UberPool, Lyft Line, GrabShare hav...
research
10/07/2018

Competitive Online Virtual Cluster Embedding Algorithms

In the conventional cloud service model, computing resources are allocat...
research
05/14/2021

Multi-Tier Adaptive Memory Programming and Cluster- and Job-based Relocation for Distributed On-demand Crowdshipping

With rapid e-commerce growth, on-demand urban delivery is having a high ...
research
08/19/2021

Efficient Algorithms for Stochastic Ridepooling Assignment with Mixed Fleets

Ridepooling plays a pivotal role in improving fleet utilization in share...
research
06/12/2014

A hybrid neuro--wavelet predictor for QoS control and stability

For distributed systems to properly react to peaks of requests, their ad...
research
11/30/2020

Accurate and Scalable Matching of Translators to Displaced Persons for Overcoming Language Barriers

Residents of developing countries are disproportionately susceptible to ...

Please sign up or login with your details

Forgot password? Click here to reset