Decentralized Matching in Shared Intelligent Vehicles Fleet

02/02/2022
by   Seyed Mehdi Meshkani, et al.
0

High computational time is one of the most important operational issues in centralized on-demand shared mobility systems. To resolve this issue, we propose a decentralized ride-matching system that is based on vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I) communication. Application on the downtown Toronto road network demonstrated that the decentralized 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 centralized system showed 29

READ FULL TEXT
research
04/17/2021

A Decentralized Shared CAV System Design and Application

In this study, we propose a novel heuristic two-step algorithm for share...
research
09/03/2018

Optimization Design of Decentralized Control for Complex Decentralized Systems

A new method is developed to deal with the problem that a complex decent...
research
07/03/2019

Challenges in IT Operations Management at a German University Chair – Ten Years in Retrospect

Over the last two decades, the majority of German universities adopted v...
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
03/25/2022

WEcharge: democratizing EV charging infrastructure

The sustainable growth of EVs will have to be met with proportional grow...
research
07/28/2021

Q-Learning for Conflict Resolution in B5G Network Automation

Network automation is gaining significant attention in the development o...
research
01/29/2022

On Optimizing Shared-ride Mobility Services with Walking Legs

Shared-ride mobility services that incorporate traveler walking legs aim...

Please sign up or login with your details

Forgot password? Click here to reset