A Ride-Matching Strategy For Large Scale Dynamic Ridesharing Services Based on Polar Coordinates

06/08/2019
by   Jiyao Li, et al.
0

In this paper, we study a challenging problem of how to pool multiple ride-share trip requests in real time under an uncertain environment. The goals are better performance metrics of efficiency and acceptable satisfaction of riders. To solve the problem effectively, an objective function that compromises the benefits and losses of dynamic ridesharing service is proposed. The Polar Coordinates based Ride-Matching strategy (PCRM) that can adapt to the satisfaction of riders on board is also addressed. In the experiment, large scale data sets from New York City (NYC) are applied. We do a case study to identify the best set of parameters of the dynamic ridesharing service with a training set of 135,252 trip requests. In addition, we also use a testing set containing 427,799 trip requests and two state-of-the-art approaches as baselines to estimate the effectiveness of our method. The experimental results show that on average 38 passengers can be served and each rider only spends an additional 3.8 minutes in ridesharing trips compared to single rider service.

READ FULL TEXT
research
07/27/2020

Balancing Taxi Distribution in City-Scale Dynamic Ridesharing Service: A Hybrid Solution Based on Demand Learning

In this paper, we study the challenging problem of how to balance taxi d...
research
04/25/2021

Fleet management for ride-pooling with meeting points at scale: a case study in the five boroughs of New York City

Introducing meeting points to ride-pooling (RP) services has been shown ...
research
08/16/2022

The least-used key selection method for information retrieval in large-scale Cloud-based service repositories

As the number of devices connected to the Internet of Things (IoT) incre...
research
03/07/2019

Can Sophisticated Dispatching Strategy Acquired by Reinforcement Learning? - A Case Study in Dynamic Courier Dispatching System

In this paper, we study a courier dispatching problem (CDP) raised from ...
research
02/03/2023

Ridepooling and public bus services: A comparative case-study

This case-study aims at a comparison of the service quality of time-tabl...
research
06/10/2016

An Application of Network Lasso Optimization For Ride Sharing Prediction

Ride sharing has important implications in terms of environmental, socia...
research
07/08/2023

Optimizing Task Waiting Times in Dynamic Vehicle Routing

We study the problem of deploying a fleet of mobile robots to service ta...

Please sign up or login with your details

Forgot password? Click here to reset