Distributed Ride-Matching for Shared Ridehailing Service with Intelligent City Infrastructure

TL;DR

This paper presents a distributed ride-matching system leveraging vehicle-to-infrastructure communication, significantly reducing computational time and improving scalability in shared ridehailing services, with notable trade-offs in wait and detour times.

Contribution

The paper introduces a novel distributed ride-matching approach utilizing V2I and I2I communication, achieving substantial speed-up and scalability improvements over centralized systems.

Findings

125x reduction in computational time

7% increase in service rate

Centralized system better in wait and detour times

Abstract

High computational time is one of the most important operational issues in centralized dynamic shared ridehailing services. To resolve this issue, we propose a distributed ride-matching system that is based on vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I) communication. The application on downtown Toronto road network demonstrated that the distributed system resulted in a speed-up of 125 times in terms of computational time and showed high scalability. Moreover, the service rate in the proposed system improved by 7% compared to the centralized. However, the centralized system showed 29% and 17% improvement in wait time and detour time, respectively.